Computing Phylogenetic Roots with Bounded Degrees and Errors

DOI10.1137/S0097539701389154MaRDI QIDQ4706236zbMATH OpenOpenAlexFDO

Authors Zhi-Zhong Chen, Tao Jiang, Guohui Lin

Publication date 19 June 2003

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539701389154

zbMATH Keywords

phylogenycomputational biologyNP-hardefficient algorithmphylogenetic root

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problems related to evolution (92D15) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Applications of design theory to circuits and networks (94C30)

Recommendations

• scientific article; zbMATH DE number 1830750
• Graph-Theoretic Concepts in Computer Science
• Approximation algorithms for bounded degree phylogenetic roots
• Computing bounded-degree phylogenetic roots of disconnected graphs
• Computing and Combinatorics

Cited in

(27)

• Cluster editing: kernelization based on edge cuts
• A \(2k\) kernel for the cluster editing problem
• A more effective linear kernelization for cluster editing
• Linear-time algorithms for tree root problems
• scientific article; zbMATH DE number 2080275 (Why is no real title available?)
• Recognizing k -Leaf Powers in Polynomial Time, for Constant k
• Simplicial powers of graphs
• Computing phylogenetic roots with bounded degrees and errors is NP-complete
• Pairwise compatibility graphs: a survey
• The 3-Steiner Root Problem
• Maximal sub-triangulation in pre-processing phylogenetic data
• scientific article; zbMATH DE number 1830750 (Why is no real title available?)
• Clustering with partial information
• Closest 4-leaf power is fixed-parameter tractable
• Computing and Combinatorics
• Clustering with qualitative information
• Fixed-parameter enumerability of cluster editing and related problems
• Parameterized leaf power recognition via embedding into graph products
• Ptolemaic Graphs and Interval Graphs Are Leaf Powers
• Simplicial Powers of Graphs
• Clustering with Partial Information
• Computing bounded-degree phylogenetic roots of disconnected graphs
• Parameterized leaf power recognition via embedding into graph products
• Graph-Theoretic Concepts in Computer Science
• Approximation algorithms for bounded degree phylogenetic roots
• A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
• Cluster graph modification problems

This page was built for publication: Computing Phylogenetic Roots with Bounded Degrees and Errors

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