Computing phylogenetic roots with bounded degrees and errors is NP-complete
DOI10.1016/J.TCS.2006.06.016zbMATH Open1153.68383OpenAlexW2011633748MaRDI QIDQ860811FDOQ860811
Authors: Tatsuie Tsukiji, Zhi-Zhong Chen 
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.06.016
Recommendations
Problems related to evolution (92D15) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms and Computation
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Graph-Theoretic Concepts in Computer Science
- On the completeness of a generalized matching problem
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Tree Powers
Cited In (7)
- Computing and Combinatorics
- A survey on pairwise compatibility graphs
- Closest 4-leaf power is fixed-parameter tractable
- Computing and Combinatorics
- On the existence of funneled orientations for classes of rooted phylogenetic networks
- Approximation algorithms for bounded degree phylogenetic roots
- The Complexity of Rooted Phylogeny Problems
This page was built for publication: Computing phylogenetic roots with bounded degrees and errors is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860811)
