A preprocessing for approximate string matching

Communications in Computer and Information Science

Volumn 252 CCIS, Issue PART 2, 2011, Pages 610-615

  Baba, Kensuke ^a   Nakatoh, Tetsuya ^a   Yamada, Yasuhiro ^b   Ikeda, Daisuke ^a  

^a KYUSHU UNIVERSITY   (Japan)

^b SHIMANE UNIVERSITY   (Japan)

Author keywords

algorithm; approximate string matching; FFT

Indexed keywords

APPROXIMATE STRING MATCHING; APPROXIMATE STRING MATCHING PROBLEM; COMPUTATION TIME; INPUT STRING; TIME COMPLEXITY;

ALGORITHMS; FAST FOURIER TRANSFORMS; INFORMATION RETRIEVAL; INFORMATION SCIENCE;

SEARCH ENGINES;

EID: 82955176917     PISSN: 18650929     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-25453-6_50     Document Type: Conference Paper

References (11)

1. Atallah, M.J., Chyzak, F., Dumas, P.: A randomized algorithm for approximate string matching. Algorithmica 29, 468-486 (2001)
2. Baba, K.: String matching with mismatches by real-valued FFT. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds.) ICCSA 2010, Part IV. LNCS, vol. 6019, pp. 273-283. Springer, Heidelberg (2010)
3. Baba, K., Shinohara, A., Takeda, M., Inenaga, S., Arikawa, S.: A note on randomized algorithm for string matching with mismatches. Nordic Journal of Computing 10(1), 2-12 (2003)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
5. Fischer, M.J., Paterson, M.S.: String-matching and other products. In: Proceedings of the SIAM-AMS Applied Mathematics Symposium Complexity of Computation, New York, pp. 113-125 (1973/1974)
6. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press (1997)
7. Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM 46(3), 395-415 (1999)
8. Navarro, G.: A guided tuor to approximate string matching. ACM Comput. Surv. 33(1), 31-88 (2001)
9. Pearson, W.R., Lipman, D.J.: Improved tools for biological sequence comparison. Proc. Natl. Acad. Sci. USA 85, 2444-2448 (1988)
10. Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. J. Mol. Biol. 147, 195-197 (1981)
11. Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168-173 (1974)