The consensus string problem for a metric is NP-complete.
Jeong Seop SimKunsoo ParkPublished in: J. Discrete Algorithms (2003)
Keyphrases
- np complete
- randomly generated
- np hard
- constraint satisfaction problems
- levenshtein distance
- satisfiability problem
- data structure
- computational complexity
- pattern matching
- distance measure
- data complexity
- polynomial time complexity
- edit distance
- directed networks
- suffix tree
- regular expressions
- database
- metric space
- distance metric
- distance function
- string matching
- bounded treewidth
- evaluation metrics
- binary strings
- np complete problems
- pspace complete
- visual analysis
- similarity metric
- neural network