Journal
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS
Volume 13, Issue 3, Pages 565-570Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TCBB.2015.2462336
Keywords
Phylogenetics; Reticulate evolution; Algorithm; Combinatorial optimization
Categories
Funding
- US National Science Foundation [IIS-0953563, CCF-1116175]
- Div Of Information & Intelligent Systems
- Direct For Computer & Info Scie & Enginr [0953563] Funding Source: National Science Foundation
Ask authors/readers for more resources
Hybridization networks represent plausible evolutionary histories of species that are affected by reticulate evolutionary processes. An established computational problem on hybridization networks is constructing the most parsimonious hybridization network such that each of the given phylogenetic trees (called gene trees) is displayed in the network. There have been several previous approaches, including an exact method and several heuristics, for this NP-hard problem. However, the exact method is only applicable to a limited range of data, and heuristic methods can be less accurate and also slow sometimes. In this paper, we develop a new algorithm for constructing near parsimonious networks for multiple binary gene trees. This method is more efficient for large numbers of gene trees than previous heuristics. This new method also produces more parsimonious results on many simulated datasets as well as a real biological dataset than a previous method. We also show that our method produces topologically more accurate networks for many datasets.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available