Algorithms and Computation

DOI10.1007/11602613MaRDI QIDQ5897906zbMATH OpenOpenAlexFDO

Authors W. Sean Kennedy, Guohui Lin

Publication date 14 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11602613

zbMATH Keywords

chordalphylogeny reconstructionSteiner rootstrictly chordal

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Complexity and performance of numerical algorithms (65Y20) Problems related to evolution (92D15)

Recommendations

• Linear time construction of 5-phylogenetic roots for tree chordal graphs
• On chordal phylogeny graphs
• scientific article; zbMATH DE number 1113981
• Graph triangulations and the compatibility of unrooted phylogenetic trees
• Graph-Theoretic Concepts in Computer Science
• Computing bounded-degree phylogenetic roots of disconnected graphs
• scientific article; zbMATH DE number 2080275
• A structure theorem for rooted binary phylogenetic networks and its implications for tree-based networks
• Recent progresses in the combinatorial and algorithmic study of rooted phylogenetic networks

Cited in

(7)

• Closest 4-leaf power is fixed-parameter tractable
• The complete inclusion structure of leaf power classes
• Linear time construction of 5-phylogenetic roots for tree chordal graphs
• The 3-Steiner Root Problem
• New results on Ptolemaic graphs
• On k- Versus (k + 1)-Leaf Powers
• Characterising \((k,\ell )\)-leaf powers

This page was built for publication: Algorithms and Computation

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