Lempel-Ziv index for q-grams

Algorithmica (New York)

Volumn 21, Issue 1, 1998, Pages 137-154

  Karkkainen J ^a   Sutinen, E ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Approximate pattern matching; Data compression; Lempel Ziv parsing; q Gram index; String algorithms; Text indexing

Indexed keywords

EID: 0042209438     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009205     Document Type: Article

References (24)

1. R. Baeza-Yates: Space-time trade-offs in text retrieval. In: Proc. First South American Workshop on String Processing (eds. R. Baeza-Yates and N. Ziviani), Universidade Federal de Minas Gerais, 1993, pp. 15-21.
2. R. Boyer and S. Moore: A fast string searching algorithm. Comm. ACM 20(10) (1977), 762-772.
3. A. Califano and I. Rigoutsos: FLASH: A fast look-up algorithm for string homology. In: Proc. First International Conference on Intelligent Systems for Molecular Biology (eds. L. Hunter, D. Searls, and J. Shavlik), AAAI Press, Menlo Park, 1993, pp. 56-64.
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: Proc. 5th Annual Symposium on Combinatorial Pattern Matching CPM '94 (eds. M. Crochemore and D. Gusfield), Lecture Notes in Computer Science, Vol. 807, Springer-Verlag, Berlin, 1994, pp. 259-273.
6. R. Grossi and F. Luccio: Simple and efficient string matching with k mismatches. Inform. Process. Lett. 33 (1989), 113-120.
7. N. Holsti and E. Sutinen: Approximate string matching using q-gram places. In: Proc. Seventh Finnish Symposium on Computer Science (ed. M. Penttonen), University of Joensuu, 1994, pp. 23-32.
8. P. Jokinen and E. Ukkonen: Two algorithms for approximate string matching in static texts. In: Proc. Mathematical Foundations of Computer Science 1991 (ed. A. Tarlecki), Lecture Notes in Computer Science, Vol. 520, Springer-Verlag, Berlin, 1991, pp. 240-248.
9. J. Kärkkäinen and E. Ukkonen: Lempel-Ziv parsing and sublinear-size index structures for string matching. In: Proc. 3rd South American Workshop on String Processing WSP '96 (eds. N. Ziviani et al.), Carleton University Press, Ottawa, 1996, pp. 141-155.
10. G. Landau and U. Vishkin: Fast string matching with k differences. J. Comput. System Sci. 37 (1988), 63-78.
11. O. Lehtinen, E. Sutinen, and J. Tarhio: Experiments on block indexing. In: Proc. 3rd South American Workshop on String Processing WSP '96 (eds. N. Ziviani et al.), Carleton University Press, Ottawa, 1996, pp. 183-193.
12. A. Lempel and J. Ziv: On the complexity of finite sequences. IEEE Trans. Inform. Theory, 22(1) (1977), 75-81.
13. E. M. McCreight: A space-economical suffix tree construction algorithm. J. Assoc. Comput. Mach. 23 (1976), 262-272.
14. E. Myers: A sublinear algorithm for approximate keyword searching. Algorithmica 12(4-5) (1994), 345-374.
15. P. Pevzner and M. Waterman: Multiple filtration and approximate pattern matching. Algorithmica 13 (1995), 135-154.
16. 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, Vol. 979, Springer-Verlag, Berlin, 1995, pp. 327-340.
17. E. Sutinen and J. Tarhio: Filtration with q-samples in approximate string matching. In: Proc. 7th Symposium on Combinatorial Pattern Matching CPM '96 (ed. D. Hirschberg and G. Myers), Lecture Notes in Computer Science, Vol. 1075, Springer-Verlag, Berlin, 1996, pp. 50-63.
18. T. Takaoka: Approximate pattern matching with samples. In: Proc. 5th Symposium on Algorithms and Computation ISAAC '94, Lecture Notes in Computer Science, Vol. 834, Springer-Verlag, Berlin, 1994, pp. 234-242.
19. J. Tarhio and E. Ukkonen: Approximate Boyer-Moore string matching. SIAM J. Comput. 22(2) (1993), 243-260.
20. E. Ukkonen: Finding approximate patterns in strings. J. Algorithms 6 (1985), 132-137.
21. E. Ukkonen: Approximate string matching with q-grams and maximal matches. Theoret. Comput. Sci. 92(1) (1992), 191-211.
22. E. Ukkonen: On-line construction of suffix-trees. Algorithmica 14 (1995), 249-260.
23. S. Wu and U. Manber: Fast text searching allowing errors. Comm. ACM 35(10) (1992), 83-91.
24. J. Ziv and A. Lempel: A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory, 23(3) (1977), 337-343.