The smoothed complexity of edit distance

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 357-369

  Andoni, Alexandr ^a   Krauthgamer, Robert ^b  

^a MIT MEDIA LAB   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY STRINGS; CONSTANT-FACTOR APPROXIMATION; EDIT DISTANCES; EFFICIENT ALGORITHMS; INPUT STRINGS; LONGEST COMMON SUBSEQUENCE; NEAR-LINEAR TIME; SEMI-RANDOM; SEQUENCE ALIGNMENTS;

CHLORINE COMPOUNDS; LINGUISTICS; TRANSLATION (LANGUAGES);

APPROXIMATION ALGORITHMS;

EID: 49049091571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_30     Document Type: Conference Paper

References (18)

1. [AGM+90] Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: A basic local alignment search tool. J. of Molecular Biology 215(3), 403-410 (1990)
2. 1 non-embeddability barrier: Algorithms for product metrics (manuscript, 2008)
3. [AK07] Andoni, A., Krauthgamer, R.: The computational hardness of estimating edit distance. In: 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 724-734. IEEE, Los Alamitos (2007)
4. [BEK+03] Batu, T., Ergün, F., Kilian, J., Magen, A., Raskhodnikova, S., Rubinfeld, R., Sami, R.: A sublinear algorithm for weakly approximating edit distance. In: Proceedings of the Symposium on Theory of Computing, pp. 316-324 (2003)
5. [BES06] Batu, T., Ergün, F., Sahinalp, C.: Oblivious string embeddings and edit distance approximations. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 792-801 (2006)
6. [BJKK04] Bar-Yossef, Z., Jayram, T.S., Krauthgamer, R., Kumar, R.: Approximating edit distance efficiently. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 550-559 (2004)
7. [BS95] Blum, A., Spencer, J.: Coloring random and semi-random k-colorable graphs. J. Algorithms 19(2), 204-234 (1995)
8. 1. Theory of Computing 2(11), 207-224 (2006)
9. [FK01] Feige, U., Kilian, J.: Heuristics for semirandom graph problems. J. Comput. Syst. Sci. 63(4), 639-673 (2001)
10. [FM97] Frieze, A., McDiarmid, C.: Algorithmic theory of random graphs. Random Structures and Algorithms 10(1-2), 5-42 (1997)
11. [GP06] Gollapudi, S., Panigrahy, R.: A dictionary for approximate string search and longest prefix search. In: 15th ACM international conference on Information and knowledge management, pp. 768-775. ACM, New York (2006)
12. [MP80] Masek, W.J., Paterson, M.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci. 20(1), 18-31 (1980)
13. [MTL02] Ma, B., Tromp, J., Li, M.: PatternHunter: faster and more sensitive homology search. Bioinformatics 18(3), 440-445 (2002)
14. [Nav01] Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1), 31-88 (2001)
15. [NBYST01] Navarro, G., Baeza-Yates, R., Sutinen, E., Tarhio, J.: Indexing methods for approximate string matching. IEEE Data Engineering Bulletin 24(4), 19-27 (2001); Special issue on Text and Databases. Invited paper
16. [ST03] Spielman, D.A., Teng, S.-H.: Smoothed analysis: Motivation and discrete models. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748. Springer, Heidelberg (2003)
17. [ST04] Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51(3), 385-463 (2004)
18. [WF74] Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168-173 (1974)