Minimum-width drawings of phylogenetic trees

DOI10.1007/978-3-030-36412-0_4MaRDI QIDQ2180132zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 13 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-36412-0_4

zbMATH Keywords

orthogonal upward drawingphylogenetic treetree drawing

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Problems related to evolution (92D15)

Recommendations

• Algorithms and Computation
• On upward drawings of trees on a given grid
• NP-Completeness of Minimal Width Unordered Tree Layout
• Ideal drawings of rooted trees with approximately optimal width
• Comparing trees via crossing minimization

Cited in

(7)

• Ideal drawings of rooted trees with approximately optimal width
• NP-Completeness of Minimal Width Unordered Tree Layout
• Angle and Distance Constraints on Tree Drawings
• Algorithms and Computation
• Visualizing multispecies coalescent trees: drawing gene trees inside species trees
• Tree drawings with columns
• Visualizing geophylogenies -- internal and external labeling with phylogenetic tree constraints

This page was built for publication: Minimum-width drawings of phylogenetic trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180132)