Computing bounded-degree phylogenetic roots of disconnected graphs

DOI10.1016/J.JALGOR.2004.12.004MaRDI QIDQ5478010zbMATH OpenOpenAlexFDO

Authors Zhi-Zhong Chen, Tatsuie Tsukiji

Publication date 30 June 2006

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.12.004

zbMATH Keywords

computational biologygraph algorithmgraph powerphylogenetic rootphylogenytree power

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Problems related to evolution (92D15)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 1830750
• scientific article; zbMATH DE number 2080275
• Computing Phylogenetic Roots with Bounded Degrees and Errors
• Linear time construction of 5-phylogenetic roots for tree chordal graphs

Cited in

(10)

• Closest 4-leaf power is fixed-parameter tractable
• Shortest connectivity. An introduction with applications in phylogeny.
• Linear time construction of 5-phylogenetic roots for tree chordal graphs
• The 3-Steiner Root Problem
• scientific article; zbMATH DE number 2080275 (Why is no real title available?)
• Computing Phylogenetic Roots with Bounded Degrees and Errors
• scientific article; zbMATH DE number 1830750 (Why is no real title available?)
• Graph-Theoretic Concepts in Computer Science
• Algorithms and Computation
• Approximation algorithms for bounded degree phylogenetic roots

This page was built for publication: Computing bounded-degree phylogenetic roots of disconnected graphs

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