Filtration with q-samples in approximate string matching

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

Volumn 1075, Issue , 1996, Pages 50-63

  Sutinen, Erkki ^a   Tarhio, Jorma ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

APPROXIMATE STRING MATCHING; NONOVERLAPPING; Q-GRAMS; SHORT SEQUENCES; TEXT AREAS;

DYNAMIC PROGRAMMING;

EID: 84957634267     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_4     Document Type: Conference Paper

References (22)

1. V. Arlazarov, E. Dinic, M. Kronrod, and I. Faradzev: On economical construction of the transitive closure of a directed graph. Dokl. Akad. Nauk SSSR 194 (1970), 487-488 (in Russian). English translation in Soviet Math. Dokl. 11 5, 1209-1210.
2. R. Baeza-Yates and G. Gonnet: A new approach to text searching. Communications of ACM 35, 10 (1992), 74-82.
3. R. Baeza-Yates, G. Gonnet, and M. Regnier: Analysis of Boyer-Moore-type string searching algorithms. In: Proc. First ACM-SIAM Symposium on Discrete Algorithms, 1990, 328-343.
4. W. Chang and E. Lawler: Sublinear approximate string matching and biological applications. Algorithmica 12, 4-5 (1994), 327-344.
5. W. Chang and T. Marr: Approximate string matching and local similarity. In: 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.
6. A. Cobbs: Fast approximate matching using suffix trees. In: Combinatorial Pattern Matching, Proceedings of 5th Annual Symposium (ed. Z. Galil and E. Ukkonen), Lecture Notes in Computer Science 937, Springer, Berlin, 1995, 41-54.
7. 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.
8. R. Grossi and F. Luccio: Simple and efficient string matching with k mismatches. Information Processing Letters 33 (1989), 113-120.
9. P. Jokinen, J. Tarhio, and E. Ukkonen: A comparison of approximate string matching algorithms. To appear in Software-Practice and Experience.
10. P. Jokinen and E. Ukkonen: Two algorithms for approximate string matching in static texts. In: Proceedings of Mathematical Foundations of Computer Science 1991 (ed. A. Tarlecki), Lecture Notes in Computer Science 520, Springer-Verlag, Berlin, 1991, 240-248.
11. G. Landau and U. Vishkin: Fast string matching with k differences. Journal of Computer and System Sciences 37 (1988), 63-78.
12. E. Myers: A sublinear algorithm for approximate keyword searching. Algorithmica 12, 4-5 (1994), 345-374.
13. P. Pevzner and M. Waterman: Multiple filtration and approximate pattern matching. Algorithmica 13 (1995), 135-154.
14. E. Sutinen and J. Tarhio: On using q-gram locations in approximate string matching. In: Proc. 3rd Annual European Symposium on Algorithms ESA’95 (ed. P. Spirakis), Lecture Notes in Computer Science 979, Springer, Berlin, 1995, 327-340.
15. T. Takaoka: Approximate pattern matching with samples. Proceedings of ISAAC ’94, Lecture Notes in Computer Science 834, Springer-Verlag, Berlin, 1994, 234-242.
16. J. Tarhio and E. Ukkonen: Approximate Boyer-Moore string matching. SIAM Journal on Computing 22, 2 (1993), 243-260.
17. E. Ukkonen: Approximate string-matching over suffix trees. In: Combinatorial Pattern Matching, Proceedings of 4th Annual Symposium (ed. A. Apostolico et al.), Lecture Notes in Computer Science 684, Springer-Verlag, Berlin, 1993, 228-243.
18. E. Ukkonen: Approximate string matching with q-grams and maximal matches. Theoretical Computer Science 92, 1 (1992), 191-211.
19. E. Ukkonen: Finding approximate patterns in strings. Journal of Algorithms 6 (1985), 132-137.
20. I. Witten, A. Moffat, and T. Bell: Managing Gigabytes, Vein Nostrand Reinhold, New York, 1994.
21. S. Wu: Approximate pattern matching and its applications. Ph.D. Thesis, Report TR 92-21, Department of Computer Science, University of Arizona, 1992.
22. S. Wu and U. Member: Fast text searching allowing errors. Communications of ACM 35, 10 (1992), 83-91.