Computing phylogenetic roots with bounded degrees and errors is NP-complete
Authors:
- Tatsuie TsukijiTTTatsuie Tsukiji
- Zhi-Zhong ChenZCZhi-Zhong Chen
- 1 October 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 363 (1) , 43-59
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education, Culture, Sports, Science and Technology (17500012, 771)
This publication has 6 references indexed in Scilit:
- Computing Phylogenetic Roots with Bounded Degrees and ErrorsSIAM Journal on Computing, 2003
- Tree PowersJournal of Algorithms, 1998
- Algorithms for Square Roots of GraphsSIAM Journal on Discrete Mathematics, 1995
- Computing roots of graphs is hardDiscrete Applied Mathematics, 1994
- The complexity of computing the permanentTheoretical Computer Science, 1979
- The Planar Hamiltonian Circuit Problem is NP-CompleteSIAM Journal on Computing, 1976