Skip to main content
SpringerLink
Log in

Maxime Crochemore, Thierry Lecroq

Text Searching and Indexing

  • Chapter
Recent Advances in Formal Languages and Applications

Part of the book series: Studies in Computational Intelligence ((SCI,volume 25))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Andersson and S. Nilsson. Improved behavior of tries by adaptive branching, Inf. Process. Lett., 46, 6 (1993), 295-300.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. Apostolico and R. Giancarlo. The Boyer-Moore-Galil string searching strategies revisited, SIAM J. Comput., 15, 1 (1986), 98-105.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler and R. McConnel. Linear size finite automata for the set of all subwords of a word: an outline of results, Bull. Eur. Assoc. Theor. Comput. Sci., 21 (1983), 12-20.

    Google Scholar 

  4. R. S. Boyer and J. S. Moore. A fast string searching algorithm, Commun. ACM, 20,10 (1977),762-772.

    Article  Google Scholar 

  5. D. Breslauer, L. Colussi and L. Toniolo. Tight comparison bounds for the string prefix-matching problem, Inf. Process. Lett., 47, 1 (1993), 51-57.

    Article  MATH  MathSciNet  Google Scholar 

  6. R. Cole. Tight bounds on the complexity of the Boyer-Moore string matching algorithm, SIAM J. Comput., 23, 5 (1994), 1075-1091.

    Article  MathSciNet  Google Scholar 

  7. R. Cole, R. Hariharan, M. Paterson, and U. Zwick. Tighter lower bounds on the exact complexity of string matching, SIAM J. Comput., 24, 1 (1995), 30-45.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Crochemore. Linear searching for a square in a word, Bull. Eur. Assoc. Theor. Comput. Sci., 24 (1984), 66-72.

    Google Scholar 

  9. M. Crochemore and D. Perrin. Two-way string-matching, J. Assoc. Comput. Mach., 38, 3 (1991), 651-675.

    MATH  MathSciNet  Google Scholar 

  10. M. Crochemore. String-matching on ordered alphabets, Theor. Comput. Sci., 92,1 (1992),33-47.

    Article  MATH  MathSciNet  Google Scholar 

  11. M. Crochemore, A. Czumaj, L. Gasieniec, S. Jarominek, T. Lecroq, W. Plandowski and W. Rytter. Speeding up two string matching algorithms, Algorithmica, 12, 4/5 (1994), 247-267.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. Crochemore and T. Lecroq. Tight bounds on the complexity of the Apostolico-Giancarlo algorithm, Inf. Process. Lett., 63, 4 (1997), 195-203.

    Article  MathSciNet  Google Scholar 

  13. M. Crochemore, L. Gasieniec, and W. Rytter. Constant-space string-matching in sublinear average time, Theor. Comput. Sci., 218, 1 (1999), 197-203.

    Article  MATH  MathSciNet  Google Scholar 

  14. M. Crochemore and R. Vérin. Direct construction of compact directed acyclic word graphs, Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching, (A. Apostolico and J. Hein, eds.), LNCS 1264, Springer-Verlag, Berlin, 1997, 116-129.

    Google Scholar 

  15. M. Farach. Optimal suffix tree construction with large alphabets, Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science, Miami Beach, FL, 1997, 137-143.

    Chapter  Google Scholar 

  16. P. Ferragina and R. Grossi. The string B-tree: A new data structure for string search in external memory and its applications, J. Assoc. Comput. Mach., 46, 2 (1999),236-280.

    MATH  MathSciNet  Google Scholar 

  17. Z. Galil. On improving the worst case running time of the Boyer-Moore string searching algorithm, Commun. ACM, 22, 9 (1979), 505-508.

    Article  MATH  MathSciNet  Google Scholar 

  18. Z. Galil and J. Seiferas. Time-space optimal string matching, J. Comput. Syst. Sci., 26, 3 (1983), 280-294.

    Article  MathSciNet  Google Scholar 

  19. Z. Galil and R. Giancarlo. On the exact complexity of string matching: lower bounds, SIAM J. Comput., 20, 6 (1991), 1008-1020.

    Article  MATH  MathSciNet  Google Scholar 

  20. L. Gasieniec, W. Plandowski and W. Rytter. Constant-space string matching with smaller number of comparisons: sequential sampling, Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching, (Z. Galil and E. Ukkonen, eds.), LNCS 937, Springer-Verlag, Berlin, 1995, 78-89.

    Google Scholar 

  21. G. H. Gonnet. The PAT text searching system, Report, Department of Computer Science, University of Waterloo, Ontario, 1987.

    Google Scholar 

  22. R. Grossi, A. Gupta and J. S. Vitter. When indexing equals compression: experiments with compressing suffix array and applications, Proceedings of the 15th ACM-SIAM Annual Symposium on Discrete Algorithms, (J.I. Munro, ed.), New Orleans, LO, 2004, 636-645.

    Google Scholar 

  23. L. J. Guibas and A. M. Odlyzko. A new proof of the linearity of the Boyer-Moore string searching algorithm, SIAM J. Comput., 9, 4 (1980, 672-682.

    Article  MATH  MathSciNet  Google Scholar 

  24. C. Hancart. On Simon’s string searching algorithm, Inf. Process. Lett., 47, 2 (1993),95-99.

    Article  MATH  MathSciNet  Google Scholar 

  25. C. Hancart, 1996. Personal communication.

    Google Scholar 

  26. J. Holub and M. Crochemore. On the implementation of compact dawg’s, Proceedings of the 7th Conference on Implementation and Application of Automata, (J.-M. Champarnaud and D. Morel, eds.), LNCS 2608, Springer-Verlag, Berlin, 2002,289-294.

    Google Scholar 

  27. S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, G. Mauri and G. Pavesi. On-line construction of compact directed acyclic word graphs, Pro- ceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, (A. Amir and G.M. Landau, eds.), LNCS 2089, Springer-Verlag, Berlin, 2001, 169-180.

    Google Scholar 

  28. R. W. Irving. Suffix binary search trees, Technical report, University of Glasgow, Computing Science Department, 1996.

    Google Scholar 

  29. J. Kärkkäinen. Suffix cactus: a cross between suffix tree and suffix array, Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching, (Z. Galil and E. Ukkonen, eds.), LNCS937, Springer-Verlag, Berlin, 1995, 191-204.

    Google Scholar 

  30. J. Kärkkäinen and P. Sanders. Simple linear work suffix array construction, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, LNCS 2719, Springer-Verlag, Berlin, 2003, 943-955.

    Chapter  Google Scholar 

  31. D. K. Kim, J. S. Sim, H. Park and K. Park. Linear-time construction of suffix arrays, Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, (R.A. Baeza-Yates, E. Chávez, and M. Crochemore, eds.), LNCS 2676, Springer-Verlag, Berlin, 2003, 186-199.

    Chapter  Google Scholar 

  32. P. Ko and S. Aluru. Space efficient linear time construction of suffix arrays, Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, (R.A. Baeza-Yates, E. Chávez, and M. Crochemore, eds.), LNCS 2676, SpringerVerlag, Berlin, 2003, 200-210.

    Chapter  Google Scholar 

  33. D. E. Knuth, J. H. Morris Jr and V. R. Pratt. Fast pattern matching in strings, SIAM J. Comput., 6, 1 (1977), 323-350.

    Article  MATH  MathSciNet  Google Scholar 

  34. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches, SIAM J. Comput., 22, 5 (1993), 935-948.

    Article  MATH  MathSciNet  Google Scholar 

  35. E. M. McCreight. A space-economical suffix tree construction algorithm, J. Algorithms, 23, 2 (1976), 262-272.

    MATH  MathSciNet  Google Scholar 

  36. J.H. Morris, Jr and V.R. Pratt. A linear pattern-matching algorithm, Report 40, University of California, Berkeley, 1970.

    Google Scholar 

  37. J. I. Munro, V. Raman and S. S. Rao. Space efficient suffix trees, J. Algorithms, 39,2 (2001),205-222.

    Article  MathSciNet  Google Scholar 

  38. I. Simon. Sequence comparison: some theory and some practice, Electronic, Dictionaries and Automata in Computational Linguistics, (M. Gross and D. Perrin, eds.), LNCS 377, Springer-Verlag, Berlin, 1989, 79-92.

    Google Scholar 

  39. E. Ukkonen. Approximate string matching with q-grams and maximal matches, Theor. Comput. Sci., 92, 1 (1992), 191-212.

    Article  MATH  MathSciNet  Google Scholar 

  40. P. Weiner. Linear pattern matching algorithm, Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, Washington, DC, 1973, 1-11.

    Google Scholar 

  41. A. C. Yao. The complexity of pattern matching for a random string, SIAM J. Comput., 8, 3 (1979), 368-387.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, 652, H-6701, Szeged, Hungary

    Zoltán Esik

  2. Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco, 1, 43005, Tarrangona, Spain

    Zoltán Esik

  3. Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco, 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  4. Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Victor Mitrana

  5. Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco, 1, 43005, Tarrangona, Spain

    Victor Mitrana

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2006). Maxime Crochemore, Thierry Lecroq. In: Esik, Z., Martín-Vide, C., Mitrana, V. (eds) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-33461-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-33461-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33460-6

  • Online ISBN: 978-3-540-33461-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation