Approximate pattern matching with samples

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

Volumn 834 LNCS, Issue , 1994, Pages 234-242

  Takaoka, Tadao ^a  

^a IBARAKI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY DISTRIBUTIONS;

APPROXIMATE PATTERN MATCHING; APPROXIMATE STRING MATCHING PROBLEM; EXPECTED TIME; SIMPLIFIED ALGORITHMS; SUBLINEAR;

PATTERN MATCHING;

EID: 85027496108     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58325-4_186     Document Type: Conference Paper

References (18)

1. Amir, A., Landau, G. M.: Fast parallel and serial multidimensional approximate array matching. Theor. Comput. Sci. 81 (1991) 97-115
2. Baeza-Yates, R. A., Perleberg, C. H.: Fast and practical approximate string matching. Proc. 3rd Ann. Symp. on Combinatorial Pattern Matching (1992) 185-192
3. Baker, T. P.: A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comput. 7 (1978) 533-541
4. Bird, R. S.: Two dimensional pattern matching. Info. Proc. Lett. 6 (1977) 168-170
5. Boyer, R. S., Moore, J. S.: A fast string searching algorithm. CACM 20 (1977), 767-772
6. Chang, W. I., Lawler,E. L.: Approximate string matching in sublinear expected time. FOCS 31 (1990) 116-124
7. Erickson, B. W., Sellers, P. H.: Recognition of patterns in genetic sequences, in Sankoff and Kruskal (eds.), Time warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, 55-91 (1983)
8. Galil, Z., Park, K.: An improved algorithm for approximate string matching. ICALP’89, LNCS 372 (1989) 394-404
9. Galil, Z., Park, K.: Truly alphabet-independent two-dimensional pattern matching. FOCS 33 (1992) 247-256
10. Karp, R. M., Rabin, M. O.: Efficient randomized pattern-matching algorithms. IBM J. of Res. and Dev. 31 (1987) 249-260
11. Knuth, D. E., Morris, J. H., Pratt, V. R.: Fast pattern matching in strings. SIAM J. Comput. 6 (1977) 323-350
12. Landau, G. M., Vishkin, U.: Efficient string matching with k mismatches. Theor. Comput. Sci. (1985) 239-249
13. Landau, G. M., Vishkin, U. Fast string matching with k differences. JCSS 37 (1988) 63-78
14. Ukkonen, E.: Algorithms for approximate string matching. Information and Control 64 (1985) 100-118
15. Ukkonen, E.: Finding approximate patterns in strings. J. Algorithms 6 (1985) 132-137
16. Vishkin, U.: Deterministic sampling-A new technique for fast pattern matching. STOC 22 (1990) 170-180
17. Wu, S., Manber, U.: Fast text searching with errors. Tech. Rep. TR-91-11, Dept. of Comp. Sci., Univ. of Arizona (1991)
18. Zhu, R. F., Takaoka, T.: A technique for two-dimensional pattern matching. CACM 32 (1989) 1110-1120