On using q-gram locations in approximate string matching

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

Volumn 979, Issue , 1995, Pages 327-340

  Sutinen, Erkki ^a   Tarhio, Jorma ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMATE STRING MATCHING; FILTRATION EFFICIENCY; FIXED PERIOD; Q-GRAMS; SUBLINEAR; TEXT AREAS;

DYNAMIC PROGRAMMING;

EID: 84947737449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60313-1_153     Document Type: Conference Paper

References (15)

1. R. Baeza-Yates and G. Gonnet: A new approach to text searching. Communications of ACM 35, 10 (1992), 74-82.
2. W. Chang and E. Lawler: Sublinear approximate string matching and biological applications. Algorithmiea 12 (1994), 327-344.
3. W. Chang and T. Marr: approximate string matching and local similarity. Combinatorial Pattern Matching, Proceedings of 5th Annual Symposium (ed. M. Crochemore and D. Gusfield), Lecture Notes in Computer Science 807, Springer-Verlag, Berlin, 1994, 259-273.
4. Z. Galil and K. Park: An improved algorithm for approximate string matching. Proceedings of 16th International Colloquium on Automata, Languages and Programming (ed. M. Chytil et al.), Lecture Notes in Computer Science 372, Springer-Verlag, Berlin, 1989, 394-404.
5. N. Holsti and E. Sutinen: Approximate string matching using q-gram places. Proc. Seventh Finnish Symposium on Computer Science (ed. M. Penttonen), University of Joensuu, 1994, 23-32.
6. R. Grossi and F. Luccio: Simple and efficient string matching with k mismatches. Information Processing Letters 33 (1989), 113-120.
7. P. Jokinen, J. Tarhio, and E. Ukkonen: A comparison of approximate string matching algorithms. Report A-1991-7, Department of Computer Science, University of Helsinki, 1991.
8. R. Karp and M. Rabin: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 31 (1987), 249-260.
9. th Annual Symposium (ed. A. Apostolico et al.), Lecture Notes in Computer Science 684, Springer-Verlag, Berlin, 1993, 197-214.
10. E. Sutinen and J. Tarhio: Information retrieval based on q-gram locations. In preparation.
11. T. Takaoka: Approximate pattern matching with samples. Proceedings of ISAAC '94, Lecture Notes in Computer Science 834, Springer-Verlag, Berlin, 1994, 234-242.
12. J. Tarhio and E. Ukkonen: Approximate Boyer-Moore string matching. SIAM Journal on Computing 22, 2 (1993), 243-260.
13. E. Ukkonen: Approximate string matching with q-grams and maximal matches. Theoretical Computer Science 92, 1 (1992), 191-211.
14. E. Ukkonen: Finding approximate patterns in strings. Journal of Algorithms 6 (1985), 132-137.
15. S. Wu and U. Manber: Fast text searching allowing errors. Communications of ACM35, 10 (1992), 83-91.