Skip to main content
Conference Proceedings

Minimal triangulation algorithms for perfect phylogeny problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8370 LNCS 421-432
DOI: 10.1007/978-3-319-04921-2_34
7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we show that minimal triangulation techniques similar to those proposed by Bouchitté and Todinca can be applied to a variety of perfect phylogeny (or character compatibility) problems. These problems arise in the context of supertree construction, a critical step in estimating the Tree of Life. © 2014 Springer International Publishing.

Author supplied keywords

Cite

CITATION STYLE

APA

Gysel, R. (2014). Minimal triangulation algorithms for perfect phylogeny problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8370 LNCS, pp. 421–432). https://doi.org/10.1007/978-3-319-04921-2_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free