The intractability of computing the Hamming distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2906, Issue , 2003, Pages 88-97

  Manthey, Bodo ^a   Reischuk, Rüdiger ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

EDIT DISTANCE; INPUT STRING; MINIMUM HAMMING DISTANCES; PARAMETERIZED;

HAMMING DISTANCE;

EID: 35248881562     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_11     Document Type: Article

References (15)

1. Alfred V. Aho and Thomas G. Petersen. A minimum distance error-correcting parser for context-free languages. SIAM Journal on Computing, 1(4):305-312, 1972.
2. Rodney G. Downey and Michael R. Fellows. Parameterized Complexity. Springer, 1999.
3. Merrick Furst, James B. Saxe, and Michael Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13-27, 1984.
4. Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, 1995.
5. Daniel M. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
6. Magnús M. Halldórsson. Approximating the minimum maximal independence number. Information Processing Letters, 46(4):169-172, 1993.
7. Lane A. Hemachandra. Algorithms from complexity theory: Polynomial-time operations for complex sets. In Proc. of the SIGAL Int. Symp. on Algorithms, volume 450 of Lecture Notes in Computer Science, pages 221-231. Springer, 1990.
8. Edgar T. Irons. An error-correcting parse algorithm. Communications of the ACM, 6(11):669-673, 1963.
9. Richard M. Karp. Mapping the genome: Some combinatorial problems arising in molecular biology. In Proc. of the 25th Ann. ACM Symp. on Theory of Computing (STOC), pages 278-285, 1993.
10. Richard E. Ladner. The circuit value problem is log space complete for P. SIGACT News, 7(1):18-20, 1975.
11. Gordon Lyon. Syntax-directed least-errors analysis for context-free languages: A practical approach. Communications of the ACM, 17(1):3-14, 1974.
12. Gonzalo Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
13. Pavel A. Pevzner. Computational Molecular Biology: An Algorithmic Approach. MIT Press, 2000.
14. Giovanni Pighizzini. How hard is computing the edit distance? Information and Computation, 165(1):1-13, 2001.
15. Daniel A. Spielman. The complexity of error-correcting codes. In Proc. of the 11th Int. Symp. on Fundamentals of Computation Theory (FCT), volume 1279 of Lecture Notes in Computer Science, pages 67-84. Springer, 1997.