Skip to main content
SpringerLink
Log in

Finding Patterns in Given Intervals

  • Conference paper
Mathematical Foundations of Computer Science 2007 (MFCS 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4708))

Abstract

In this paper, we study the pattern matching problem in given intervals. Depending on whether the intervals are given a priori for pre-processing, or during the query along with the pattern or, even in both cases, we develop solutions for different variants of this problem. In particular, we present efficient indexing schemes for each of the above variants of the problem.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.: Range searching in categorical data: Colored range searching on grid. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 17–28. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: SODA, pp. 1221–1229. ACM Press, New York (2006)

    Chapter  Google Scholar 

  3. Amir, A., Butman, A., Crochemore, M., Landau, G.M., Schaps, M.: Two-dimensional pattern matching with rotations. Theor. Comput. Sci. 314(1-2), 173–187 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Amir, A., Butman, A., Lewenstein, M.: Real scaled matching. Inf. Process. Lett. 70(4), 185–190 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Amir, A., Chencinski, E.: Faster two dimensional scaled matching. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 200–210. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Amir, A., Chencinski, E., Iliopoulos, C., Kopelowitz, T., Zhang, H.: Property matching and weighted matching. In: CPM, pp. 1–15 (2006)

    Google Scholar 

  7. Amir, A., Kapah, O., Tsur, D.: Faster two dimensional pattern matching with rotations. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 409–419. Springer, Heidelberg (2004)

    Google Scholar 

  8. Bender, M.A., Farach-Colton, M.: The lca problem revisited. In: Latin American Theoretical INformatics (LATIN), pp. 88–94 (2000)

    Google Scholar 

  9. Butman, A., Eres, R., Landau, G.M.: Scaled and permuted string matching. Inf. Process. Lett. 92(6), 293–297 (2004)

    Article  MathSciNet  Google Scholar 

  10. Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don’t cares. In: Babai, L. (ed.) STOC, pp. 91–100. ACM Press, New York (2004)

    Google Scholar 

  11. Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In: STOC, pp. 592–601 (2002)

    Google Scholar 

  12. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)

    Google Scholar 

  13. Farach, M.: Optimal suffix tree construction with large alphabets. In: FOCS, pp. 137–143 (1997)

    Google Scholar 

  14. Fischer, M., Paterson, M.: String matching and other products. In: Karp, R.M. (ed.) Complexity of Computation. SIAM AMS Proceedings, vol. 7, pp. 113–125 (1974)

    Google Scholar 

  15. Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for geometry problems. In: Symposium on the Theory of Computing (STOC), pp. 135–143 (1984)

    Google Scholar 

  16. Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  17. Hirschberg, D.S.: Algorithms for the longest common subsequence problem. J. ACM 24(4), 664–675 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  18. Jurka, J.: Human repetitive elements. In: Meyers, R.A. (ed.) Molecular Biology and Biotechnology

    Google Scholar 

  19. Jurka, J.: Origin and evolution of alu repetitive elements. In: Maraia, R. (ed.) The impact of short interspersed elements (SINEs) on the host genome

    Google Scholar 

  20. Levenshtein, V.: Binary codes capable of correcting, deletions, insertions and reversals. Soviet Phys. Dokl. 10, 707–710 (1966)

    MathSciNet  Google Scholar 

  21. Mäkinen, V., Navarro, G.: Position-restricted substring searching. In: LATIN, pp. 1–12 (2006)

    Google Scholar 

  22. McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262–272 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  23. Rahman, M.S., Iliopoulos, C., Lee, I., Mohamed, M., Smyth, W.: Finding patterns with variable length gaps or don’t cares. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 146–155. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  24. Sadakane, K.: Succinct data structures for flexible text retrieval systems. Journal of Discrete Algorithms 5(1), 12–22 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  25. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249–260 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Algorithm Design Group, Department of Computer Science, King’s College London, Strand, London WC2R 2LS, England

    Maxime Crochemore, Costas S. Iliopoulos & M. Sohel Rahman

  2. Institut Gaspard-Monge, University of Marne-la-Vallée, France

    Maxime Crochemore

Authors
  1. Maxime Crochemore
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Costas S. Iliopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Sohel Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luděk Kučera Antonín Kučera

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crochemore, M., Iliopoulos, C.S., Rahman, M.S. (2007). Finding Patterns in Given Intervals. In: Kučera, L., Kučera, A. (eds) Mathematical Foundations of Computer Science 2007. MFCS 2007. Lecture Notes in Computer Science, vol 4708. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74456-6_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74455-9

  • Online ISBN: 978-3-540-74456-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation