Solving the Tree Containment Problem for Reticulation-Visible Networks in Linear Time
The tree containment problem (TCP) is a fundamental problem in phylogenetic study. It was introduced as a mean for verifying whether a network is consistent with a binary tree. The containment problem is NP-complete, even if the network input is binary. If the input is restricted to reticulation-visible networks, the TCP has been proved to be solvable in quadratic time. In this paper, we show that there is a linear time TCP algorithm for binary reticulation-visible networks.
KeywordsPhylogeny reconstruction Tree containment problem Reticulation-visible
I’d like to thank Prof. Zhang Louxin for his guidance and help. The project is financially supported by Singapore MoE-ARF Tier 1 grant, R-146-000-238-114.