Name
Abstract | ||
|---|---|---|
Construction of phylogenetic trees has traditionally focused on binary trees where all species appear on leaves, a problem for which numerous efficient solutions have been developed. Certain application domains though, such as viral evolution and transmission, paleontology, linguistics, and phylogenetic stemmatics, often require phylogeny inference that involves placing input species on ancestral tree nodes (live phylogeny), and polytomies. These requirements, despite their prevalence, lead to computationally harder algorithmic solutions and have been sparsely examined in the literature to date. In this article we prove some unique properties of most parsimonious live phylogenetic trees with polytomies, and their mapping to traditional binary phylogenetic trees. We show that our problem reduces to finding the most compact parsimonious tree for n species, and describe a novel efficient algorithm to find such trees without resorting to exhaustive enumeration of all possible tree topologies. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.compbiolchem.2017.03.013 | Computational Biology and Chemistry |
Keywords | Field | DocType |
Phylogenetics,Maximum parsimony,Live phylogeny,Polytomies | Maximum parsimony,Phylogenetic tree,Tree rearrangement,Biology,Inference,Enumeration,Binary tree,Bioinformatics,Phylogenetics,Phylogenetic network | Journal |
Volume | ISSN | Citations |
69 | 1476-9271 | 0 |
PageRank | References | Authors |
0.34 | 8 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dimitris Papamichail | 1 | 4 | 4.86 |
| Angela Huang | 2 | 0 | 0.34 |
| E. Kennedy | 3 | 0 | 0.34 |
| J.-L. Ott | 4 | 0 | 0.34 |
| Andrew Miller | 5 | 0 | 2.37 |
| Georgios P. Papamichail | 6 | 6 | 2.68 |