Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. A. Apostolico and F. P. Preparata. Optimal off-line detection of repetitions in a string, Theoretical Computer Science, pages 297–315, 1983.
2. W. L. Chang and E. L. Lawler. Approximate string matching in sublinear expected time. Proc. of 31st IEEE FOCS, pages 116–124, 1990.
3. M. T. Chen and J. Seiferas. Efficient and elegant subword tree construction. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, pages 97–107. Springer-Verlag, 1985.
4. M. Crochemore. An optimal algorithm for computing the repetitions in a word, Inf. Processing Letters 12, pages 244–250, 1981.
5. M. Crochemore. Transducers and repetitions, Theoretical Computer Science, pages 63–86, 1986.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficiency Analysis of Tandem Substring Search Methods;2023 24th International Carpathian Control Conference (ICCC);2023-06-12
2. Longest Gapped Repeats and Palindromes;Mathematical Foundations of Computer Science 2015;2015
3. Locating All Maximal Approximate Runs in a String;Combinatorial Pattern Matching;2013
4. On Suffix Extensions in Suffix Trees;String Processing and Information Retrieval;2011
5. A Minimal Periods Algorithm with Applications;Combinatorial Pattern Matching;2010