Reconstructing phylogenetic trees from multipartite quartet systems
Abstract
A phylogenetic tree is a graphical representation of an evolutionary history of taxa in which the leaves correspond to the taxa and the non-leaves correspond to speciations. One of important problems in phylogenetic analysis is to assemble a global phylogenetic tree from small phylogenetic trees, particularly, quartet trees. {\sc Quartet Compatibility} is the problem of deciding whether there is a phylogenetic tree inducing a given collection of quartet trees, and to construct such a phylogenetic tree if it exists. It is known that {\sc Quartet Compatibility} is NP-hard and that there are only a few results known for polynomial-time solvable subclasses. In this paper, we introduce two novel classes of quartet systems, called complete multipartite quartet system and full multipartite quartet system, and present polynomial-time algorithms for {\sc Quartet Compatibility} for these systems.
Cite
@article{arxiv.1904.01914,
title = {Reconstructing phylogenetic trees from multipartite quartet systems},
author = {Hiroshi Hirai and Yuni Iwamasa},
journal= {arXiv preprint arXiv:1904.01914},
year = {2022}
}
Comments
To appear in Algorithmica. This version of the article has been accepted for publication, after peer review (when applicable) but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s00453-022-00945-9