Optimizing tree and character compatibility across several phylogenetic trees
From MaRDI portal
Publication:391984
DOI10.1016/j.tcs.2013.10.015zbMath1358.68140MaRDI QIDQ391984
Charles Semple, Simone Linz, Katherine St. John
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.10.015
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
92D15: Problems related to evolution
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of reconstructing trees from qualitative characters and subtrees
- A framework for representing reticulate evolution
- Phylogenetic supertrees. Combining information to reveal the tree of life
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Two strikes against perfect phylogeny
- Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
- Efficient algorithms for inferring evolutionary trees