Computing bounded-degree phylogenetic roots of disconnected graphs

DOI10.1016/J.JALGOR.2004.12.004zbMATH Open1103.68089OpenAlexW2091622619MaRDI QIDQ5478010FDOQ5478010

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

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

zbMATH Keywords

phylogenycomputational biologygraph algorithmgraph powerphylogenetic roottree power

Mathematics Subject Classification ID

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

Cited In (10)

• Computing Phylogenetic Roots with Bounded Degrees and Errors
• Shortest connectivity. An introduction with applications in phylogeny.
• Title not available (Why is that?)
• Algorithms and Computation
• The 3-Steiner Root Problem
• Title not available (Why is that?)
• Linear time construction of 5-phylogenetic roots for tree chordal graphs
• Closest 4-leaf power is fixed-parameter tractable
• Graph-Theoretic Concepts in Computer Science
• 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)