Computing the longest common substring with one mismatch | Problems of Information Transmission Skip to main content
Springer Nature Link
Log in

Computing the longest common substring with one mismatch

  • Large Systems
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

The paper describes an algorithm for computing longest common substrings of two strings α 1 and α 2 with one mismatch in O(|α 1||α 2|) time and O(|α 1|) additional space. The algorithm always scans symbols of α 2 sequentially, starting from the first symbol. The RAM model of computation is used.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gusfield, D., Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge: Cambridge Univ. Press, 1997. Translated under the title Stroki, derev’ya i posledovatel’nosti v algoritmakh: informatika i vychislitel’naya biologiya, St. Petersburg: Nevskii Dialekt, 2003.

    Book  MATH  Google Scholar 

  2. Aho, A.V., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms, Reading: Addison-Wesley, 1976. Translated under the title Postroenie i analiz vychislitel’nykh algoritmov, Moscow: Williams, 2003.

    Google Scholar 

  3. Ukkonen, E., On-Line Construction of Suffix Trees, Algorithmica, 1995, vol. 14, no. 3, pp. 249–260.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chair of Mathematical Logic and Theory of Algorithms, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Moscow, Russia

    M. A. Babenko & T. A. Starikovskaya

Authors
  1. M. A. Babenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. A. Starikovskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. A. Babenko.

Additional information

Original Russian Text © M.A. Babenko, T.A. Starikovskaya, 2011, published in Problemy Peredachi Informatsii, 2011, Vol. 47, No. 1, pp. 33–39.

Supported in part by the Russian Foundation for Basic Research, project no. 09-01-00709-a.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Babenko, M.A., Starikovskaya, T.A. Computing the longest common substring with one mismatch. Probl Inf Transm 47, 28–33 (2011). https://doi.org/10.1134/S0032946011010030

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946011010030

Keywords

Search

Navigation