RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Probl. Peredachi Inf., 2011, Volume 47, Issue 1, Pages 33–39 (Mi ppi2035)  

This article is cited in 3 scientific papers (total in 3 papers)

Large Systems

Computing the longest common substring with one mismatch

M. A. Babenko, T. A. Starikovskaya

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

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

Full text: PDF file (207 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2011, 47:1, 28–33

Bibliographic databases:

UDC: 621.391.15+519.1
Received: 07.05.2010
Revised: 24.08.2010

Citation: M. A. Babenko, T. A. Starikovskaya, “Computing the longest common substring with one mismatch”, Probl. Peredachi Inf., 47:1 (2011), 33–39; Problems Inform. Transmission, 47:1 (2011), 28–33

Citation in format AMSBIB
\Bibitem{BabSta11}
\by M.~A.~Babenko, T.~A.~Starikovskaya
\paper Computing the longest common substring with one mismatch
\jour Probl. Peredachi Inf.
\yr 2011
\vol 47
\issue 1
\pages 33--39
\mathnet{http://mi.mathnet.ru/ppi2035}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2815318}
\transl
\jour Problems Inform. Transmission
\yr 2011
\vol 47
\issue 1
\pages 28--33
\crossref{https://doi.org/10.1134/S0032946011010030}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000289689300003}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-80051626704}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2035
  • http://mi.mathnet.ru/eng/ppi/v47/i1/p33

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Grabowski S., “a Note on the Longest Common Substring With K-Mismatches Problem”, Inf. Process. Lett., 115:6-8 (2015), 640–642  crossref  mathscinet  zmath  isi  elib  scopus
    2. Flouri T., Giaquinta E., Kobert K., Ukkonen E., “Longest Common Substrings With K Mismatches”, Inf. Process. Lett., 115:6-8 (2015), 643–647  crossref  mathscinet  zmath  isi  elib  scopus
    3. Tang Ya., Wang H., Guo K., Xiao Y., Chi T., “Relevant Feedback Based Accurate and Intelligent Retrieval on Capturing User Intention For Personalized Websites”, IEEE Access, 6 (2018), 24239–24248  crossref  isi  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:356
    Full text:91
    References:24
    First page:24

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020