Skip to main content
SpringerLink
Log in

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs

  • Conference paper
Book cover String Processing and Information Retrieval (SPIRE 2013)

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

Included in the following conference series:

Abstract

We consider how to index strings, trees and graphs for jumbled pattern matching when we are asked to return a match if one exists. For example, we show how, given a tree containing two colours, we can build a quadratic-space index with which we can find a match in time proportional to the size of the match. We also show how we need only linear space if we are content with approximate matches.

The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-02432-5_33

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Amir, A., Apostolico, A., Landau, G.M., Satta, G.: Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms 1(5-6), 409–421 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Badkobeh, G., Fici, G., Kroon, S., Lipták, Z.: Binary jumbled string matching for highly run-length compressible texts. Inf. Process. Lett. 113(17), 604–608 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Benson, G.: Composition alignment. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol. 2812, pp. 447–461. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Böcker, S.: Sequencing from compomers: Using mass spectrometry for DNA de novo sequencing of 200+ nt. J. of Computational Biology 11(6), 1110–1134 (2004)

    Article  Google Scholar 

  5. Böcker, S.: Simulating multiplexed SNP discovery rates using base-specific cleavage and mass spectrometry. Bioinformatics 23(2), 5–12 (2007)

    Article  Google Scholar 

  6. Burcsi, P., Cicalese, F., Fici, G., Lipták, Z.: Algorithms for jumbled pattern matching in strings. Int. J. Found. Comput. Sci. 23(2), 357–374 (2012)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Cicalese, F., Fici, G., Lipták, Z.: Searching for jumbled patterns in strings. In: Proc. Prague Stringology Conference (PSC 2009), pp. 105–117 (2009)

    Google Scholar 

  9. Cicalese, F., Laber, E., Weimann, O., Yuster, R.: Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence. In: Kärkkäinen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 149–158. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Didier, G., Schmidt, T., Stoye, J., Tsur, D.: Character sets of strings. J. Discrete Algorithms 5(2), 330–340 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Eres, R., Landau, G.M., Parida, L.: Permutation pattern discovery in biosequences. Journal of Computational Biology 11(6), 1050–1060 (2004)

    Article  Google Scholar 

  12. Fellows, M.R., Fertin, G., Hermelin, D., Vialette, S.: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. 77(4), 799–811 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gagie, T., Hermelin, D., Landau, G.M., Weimann, O.: Binary jumbled pattern matching on trees and tree-like structures. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 517–528. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  14. Giaquinta, E., Grabowski, S.: New algorithms for binary jumbled pattern matching. Inf. Process. Lett. 113(14-16), 538–542 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kociumaka, T., Radoszewski, J., Rytter, W.: Efficient indexes for jumbled pattern matching with constant-sized alphabet. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 625–636. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Lacroix, V., Fernandes, C.G., Sagot, M.-F.: Motif search in graphs: Application to metabolic networks. IEEE/ACM Trans. Comput. Biology Bioinform. 3(4), 360–368 (2006)

    Article  Google Scholar 

  17. Moosa, T.M., Rahman, M.S.: Sub-quadratic time and linear space data structures for permutation matching in binary strings. J. Discr. Alg. 10, 5–9 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362–391 (1983)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Salerno, Italy

    Ferdinando Cicalese

  2. Department of Computer Science, University of Helsinki, Finland

    Travis Gagie, Emanuele Giaquinta & Alexandru I. Tomescu

  3. Helsinki Institute for Information Technology, Finland

    Travis Gagie & Alexandru I. Tomescu

  4. Department of Computer Science, PUC Rio de Janeiro, Brazil

    Eduardo Sany Laber

  5. Department of Computer Science, University of Verona, Italy

    Zsuzsanna Lipták & Romeo Rizzi

Authors
  1. Ferdinando Cicalese
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Travis Gagie
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Emanuele Giaquinta
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Eduardo Sany Laber
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Zsuzsanna Lipták
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Romeo Rizzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Alexandru I. Tomescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Industrial Engineering and Management Technion, Technion Institute of Technology, Bloomfield Hall 308, 32000, Haifa, Israel

    Oren Kurland

  2. Bar-Ilan University, Israel

    Moshe Lewenstein

  3. Department of Computer Science, Bar-Ilan University, 52900, Ramat-Gan, Israel

    Ely Porat

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cicalese, F. et al. (2013). Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. In: Kurland, O., Lewenstein, M., Porat, E. (eds) String Processing and Information Retrieval. SPIRE 2013. Lecture Notes in Computer Science, vol 8214. Springer, Cham. https://doi.org/10.1007/978-3-319-02432-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02432-5_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02431-8

  • Online ISBN: 978-3-319-02432-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation