Optimizing tree and character compatibility across several phylogenetic trees

DOI10.1016/j.tcs.2013.10.015zbMath1358.68140OpenAlexW2142066054MaRDI 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

zbMATH Keywords

charactercompatibilityphylogenetic treerooted triple

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees

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

This page was built for publication: Optimizing tree and character compatibility across several phylogenetic trees