The String Barcoding Problem is NP-Hard.
Marcello DalpassoGiuseppe LanciaRomeo RizziPublished in: Comparative Genomics (2005)
Keyphrases
- np hard
- lower bound
- special case
- approximation algorithms
- scheduling problem
- linear programming
- closely related
- remains np hard
- computationally hard
- computational complexity
- worst case
- edit distance
- optimal solution
- string matching
- np complete
- data structure
- decision problems
- knapsack problem
- integer programming
- minimum cost
- context free grammars
- greedy heuristic
- pattern matching
- set cover
- branch and bound algorithm
- case study
- proximity graph
- binary strings
- computationally challenging
- dynamic programming
- suffix tree
- hamming distance
- constraint satisfaction problems