Topology of Strings: Median String is NP-Complete.
Colin de la HigueraFrancisco CasacubertaPublished in: Theor. Comput. Sci. (2000)
Keyphrases
- np complete
- edit distance
- string matching
- finite alphabet
- approximate string matching
- levenshtein distance
- suffix array
- np hard
- string similarity
- hamming distance
- closest string
- string edit distance
- binary strings
- randomly generated
- computational complexity
- pattern matching
- satisfiability problem
- conjunctive queries
- graph matching
- edit operations
- constraint satisfaction problems
- data complexity
- finite state automata
- shortest common supersequence
- alphabet size
- pspace complete
- long strings
- similarity measure
- data structure
- variable length
- polynomial time complexity
- small world
- genetic algorithm
- scheduling problem
- bounded treewidth
- phase transition
- binary images
- distance measure
- regular expressions
- median filter
- special case
- join algorithms
- character string
- topology preserving