Publication:3104398

zbMath1244.68037MaRDI QIDQ3104398

V. Yu. Popov

Publication date: 19 December 2011

zbMATH Keywords

NP-complete; longest common subsequence; sequence annotation

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W32: Algorithms on strings