Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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

Problemy Peredachi Informatsii, 2011, Volume 47, Issue 1, Pages 33–39 (Mi ppi2035)  
This article is cited in 8 scientific papers (total in 8 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
Full-text PDF (207 kB) Citations (8)
References:
PDF
HTML
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.
Received: 07.05.2010
Revised: 24.08.2010
English version:
Problems of Information Transmission, 2011, Volume 47, Issue 1, Pages 28–33
DOI: https://doi.org/10.1134/S0032946011010030
Bibliographic databases:
Document Type: Article
UDC: 621.391.15+519.1
Language: Russian
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://mathscinet.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{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000289689300003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-80051626704}
Linking options:
  • https://www.mathnet.ru/eng/ppi2035
  • https://www.mathnet.ru/eng/ppi/v47/i1/p33
    • This publication is cited in the following 8 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:458
    Full-text PDF :219
    References:39
    First page:24
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024