A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed.
Richa AgarwalaDavid Fernández-BacaPublished in: SIAM J. Comput. (1994)
Keyphrases
- computational complexity
- detection algorithm
- polynomial time complexity
- computational cost
- learning algorithm
- preprocessing
- np hard
- optimal solution
- space complexity
- optimization algorithm
- cost function
- probabilistic model
- k means
- randomized algorithm
- recognition algorithm
- memory requirements
- matching algorithm
- dynamic programming
- objective function
- np complete
- worst case
- approximation ratio
- neural network