The Cophylogeny Reconstruction Problem Is NP-Complete.
Yaniv OvadiaDaniel FielderChris ConowRan Libeskind-HadasPublished in: J. Comput. Biol. (2011)
Keyphrases
- np complete
- randomly generated
- image reconstruction
- three dimensional
- computational complexity
- satisfiability problem
- np hard
- constraint satisfaction problems
- pspace complete
- compressed sensing
- polynomially solvable
- conjunctive queries
- phase transition
- reconstruction error
- reconstruction process
- high resolution
- conp complete
- computationally complex
- real time
- tomographic reconstruction
- polynomial time complexity
- compressive sensing
- reconstruction method
- markov random field
- database systems
- case study
- knowledge base
- data sets