Skip to main content
SpringerLink
Log in

Average-Case Optimal Approximate Circular String Matching

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2015)

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

Abstract

Approximate string matching is the problem of finding all factors of a text \(t\) of length \(n\) that are at a distance at most \(k\) from a pattern \(x\) of length \(m\). Approximate circular string matching is the problem of finding all factors of \(t\) that are at a distance at most \(k\) from \(x\) or from any of its rotations. In this article, we present a new algorithm for approximate circular string matching under the edit distance model with optimal average-case search time \(\mathcal {O}(n(k + \log m) /m)\). Optimal average-case search time can also be achieved by the algorithms for multiple approximate string matching (Fredriksson and Navarro, 2004) using \(x\) and its rotations as the set of multiple patterns. Here we reduce the preprocessing time and space requirements compared to that approach.

Solon P. Pissis - Supported by a London Mathematical Society grant (no. 51303).

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. Barton, C., Iliopoulos, C.S., Pissis, S.P.: Fast algorithms for approximate circular string matching. Algorithms for Molecular Biology 9(1), 9 (2014). http://www.almob.org/content/9/1/9

  2. Chang, W.I., Marr, T.G.: Approximate string matching and local similarity. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol. 807, pp. 259–273. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  3. Chen, K.H., Huang, G.S., Lee, R.C.T.: Bit-Parallel Algorithms for Exact Circular String Matching. The Computer Journal (2013)

    Google Scholar 

  4. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, New York (2007)

    Google Scholar 

  5. Fernandes, F., Pereira, L., Freitas, A.T.: CSA: An efficient algorithm to improve circular DNA multiple alignment. BMC Bioinformatics 10(1), 1–13 (2009)

    Article  Google Scholar 

  6. Fredriksson, K., Grabowski, S.: Average-optimal string matching. Journal of Discrete Algorithms 7(4), 579–594 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fredriksson, K., Mäkinen, V., Navarro, G.: Flexible music retrieval in sublinear time. International Journal of Foundations of Computer Science 17(06), 1345–1364 (2006). http://www.worldscientific.com/doi/abs/10.1142/S0129054106004455

  8. Fredriksson, K., Navarro, G.: Average-optimal single and multiple approximate string matching. Journal of Experimental Algorithmics 9, December 2004. http://doi.acm.org/10.1145/1005813.1041513

  9. Gusfield, D.: Algorithms on Strings. Cambridge University Press, Trees and Sequences (1997)

    Google Scholar 

  10. Hirvola, T., Tarhio, J.: Approximate online matching of circular strings. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 315–325. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  11. Hsu, P.-H., Chen, K.-Y., Chao, K.-M.: Finding all approximate gapped palindromes. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 1084–1093. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Iliopoulos, C.S., Rahman, M.S.: Indexing circular patterns. In: Nakano, S., Rahman, M.S. (eds.) WALCOM 2008. LNCS, vol. 4921, pp. 46–57. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM Journal of Computing 27(2), 557–582 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lee, T., Na, J.C., Park, H., Park, K., Sim, J.S.: Finding optimal alignment and consensus of circular strings. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 310–322. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Tech. Rep. 8 (1966)

    Google Scholar 

  16. Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press (2005)

    Google Scholar 

  17. Ukkonen, E.: On approximate string matching. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 487–495. Springer, Heidelberg (1983)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, King’s College London, The Strand, London, UK

    Carl Barton, Costas S. Iliopoulos & Solon P. Pissis

  2. Department of Mathematics and Statistics, University of Western Australia, 35 Stirling Highway, Perth, Australia

    Costas S. Iliopoulos

Authors
  1. Carl Barton
    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. Solon P. Pissis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carl Barton .

Editor information

Editors and Affiliations

  1. Rovira i Virgili University, Tarragona, Spain

    Adrian-Horia Dediu

  2. Nice Sophia Antipolis University, Sophia Antipolis, France

    Enrico Formenti

  3. Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

    Carlos Martín-Vide

  4. Justus-Liebig-Universität, Gießen, Germany

    Bianca Truthe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Barton, C., Iliopoulos, C.S., Pissis, S.P. (2015). Average-Case Optimal Approximate Circular String Matching. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15579-1_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15578-4

  • Online ISBN: 978-3-319-15579-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation