Abstract
The gene-duplication problem is to infer a species tree from a collection of gene trees. The decision variant of this problem is NP-complete. The utility of this NP-hard problem for large-scale phylogenetic analyses has been largely limited by the high time complexity of existing heuristics. These methods search the whole possible suptrees. They solve a local search problem instance in each step. The NNI(nearest neighbor interchange) local search problem is a classical local search problem . In this paper, we study the duplication-loss problem and provide a novel algorithm for the k-NNI local search problem. Our improvement not only significantly enlarges the search space but also makes the time complexity better. Hence, the duplication-loss problem will be much more manageable for large scale phylogenetic analyses. KeywordsDuplication-Loss; NNI; Local search; Computational phylogenetics; Computational complexity; Algorithm
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
