Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
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


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




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

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2018, Number 3, Pages 16–21 (Mi vmumm28)  
Mathematics

Complexity of search of a substring entering in a set of strings

E. M. Perper

Kraftway Corporation PLC, Moscow
Full-text PDF (318 kB)
References:
PDF
HTML
Abstract: The paper considers the problem of listing all occurrences of an arbitrary pattern in the strings from given set. We obtain lower bound for amount of time taken by search algorithms. We also obtain the order of memory volumes required by algorithms with the best order search time.
Key words: pattern, text, occurrence, string matching, lower bound, higher bound.
Received: 27.09.2017
English version:
Moscow University Mathematics Bulletin, 2018, Volume 73, Issue 3, Pages 98–102
DOI: https://doi.org/10.3103/S0027132218030038
Bibliographic databases:
Document Type: Article
UDC: 519.712
Language: Russian
Citation: E. M. Perper, “Complexity of search of a substring entering in a set of strings”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2018, no. 3, 16–21; Moscow University Mathematics Bulletin, 73:3 (2018), 98–102
Citation in format AMSBIB
\Bibitem{Per18}
\by E.~M.~Perper
\paper Complexity of search of a substring entering in a set of strings
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2018
\issue 3
\pages 16--21
\mathnet{http://mi.mathnet.ru/vmumm28}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3831452}
\zmath{https://zbmath.org/?q=an:1400.68265}
\transl
\jour Moscow University Mathematics Bulletin
\yr 2018
\vol 73
\issue 3
\pages 98--102
\crossref{https://doi.org/10.3103/S0027132218030038}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000437465600003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85049586460}
Linking options:
  • https://www.mathnet.ru/eng/vmumm28
  • https://www.mathnet.ru/eng/vmumm/y2018/i3/p16
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024