Computing phylogenetic roots with bounded degrees and errors is NP-complete.
Tatsuie TsukijiZhi-Zhong ChenPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- np complete
- randomly generated
- bounded treewidth
- np hard
- constraint satisfaction problems
- computational complexity
- satisfiability problem
- pspace complete
- conjunctive queries
- phylogenetic trees
- information systems
- np complete problems
- phase transition
- polynomial time complexity
- polynomially solvable
- prediction error
- neural network
- genetic algorithm
- machine learning