Skip to main content
Conference Proceedings

Minimum-Width Drawings of Phylogenetic Trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11949 LNCS 39-55
DOI: 10.1007/978-3-030-36412-0_4
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that finding a minimum-width orthogonal upward drawing of a phylogenetic tree is NP-hard for binary trees with unconstrained combinatorial order and provide a linear-time algorithm for ordered trees. We also study several heuristic algorithms for the unconstrained case and show their effectiveness through experimentation.

Author supplied keywords

Cite

CITATION STYLE

APA

Besa, J. J., Goodrich, M. T., Johnson, T., & Osegueda, M. C. (2019). Minimum-Width Drawings of Phylogenetic Trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11949 LNCS, pp. 39–55). Springer. https://doi.org/10.1007/978-3-030-36412-0_4

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