Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6871099 | Discrete Applied Mathematics | 2018 | 17 Pages |
Abstract
We characterize compatibility via graph triangulations and tree decompositions. We then study how to make an incompatible collection of trees compatible through edge contraction and tree deletion. Finally, we introduce the notion of a phylogenetic minor to study under which conditions edge contraction, tree removal, and species removal/renaming operations preserve compatibility.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
David Fernández-Baca, Sudheer R. Vakati,