다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
European journal of combinatorics : Journal européen de combinatoire = Europäische Zeitschrift für Kombinatorik, v.68, 2018년, pp.242 - 248
Bollobás, Béla (Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Wilberforce Road, CB3 0WB Cambridge, UK) , Letzter, Shoham (Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Wilberforce Road, CB3 0WB Cambridge, UK)
AI-Helper
Abstract Given a word w of length n and i , j ∈ [ n ] , the longest common extension is the longest substring starting at both i and j . In this note we estimate the average length of the longest common extension over all words w and all pairs ( i , j ) , as well as the typical ...
SIAM J. Comput. Abrahamson 16 6 1039 1987 10.1137/0216067 Generalized string matching
J. Algorithms Amir 50 2 257 2004 10.1016/S0196-6774(03)00097-X Faster algorithms for string matching with k mismatches
Blanchet-Sadri 52 2016 Combinatorial Algorithms: 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers Longest common extensions in partial words
Blanchet-Sadri vol. 7810 165 2013 Language and Automata Theory and Applications Suffix trees for partial words and the longest common compatible prefix problem
Clifford 2039 2016 Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms The k-mismatch problem revisited
J. Discrete Algorithms Crochemore 34 C 49 2015 10.1016/j.jda.2015.05.003 A note on the longest common compatible prefix problem for partial words
Gusfield 1997 Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
J. Comput. System Sci. Gusfield 69 4 525 2004 10.1016/j.jcss.2004.03.004 Linear time algorithm for finding and representing all tandem repeats in a string
J. Discrete Algorithms Ilie 8 4 418 2010 10.1016/j.jda.2010.08.004 The longest common extension problem revisited and applications to approximate string searching
S.R. Kosaraju, Efficient string matching, manuscript, 1987.
J. Comput. Biol. Landau 8 1 1 2001 10.1089/106652701300099038 An algorithm for approximate tandem repeats
J. Algorithms Landau 10 2 157 1989 10.1016/0196-6774(89)90010-2 Fast parallel and serial approximate string matching
Theoret. Comput. Sci. Landau 43 239 1986 10.1016/0304-3975(86)90178-7 Efficient string matching with k mismatches
J. Algorithms Main 5 3 422 1984 10.1016/0196-6774(84)90021-X An O(nlogn) algorithm for finding all repetitions in a string
Algorithmica Myers 1 1 251 1986 10.1007/BF01840446 An O(nd) difference algorithm and its variations
Algorithms Nicolae 8 2 248 2015 10.3390/a8020248 On string matching with mismatches
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
저자가 공개 리포지터리에 출판본, post-print, 또는 pre-print를 셀프 아카이빙 하여 자유로운 이용이 가능한 논문
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.