Finding Maximal Pairs with Bounded Gap-Reference-Cited by-同舟云学术

Finding Maximal Pairs with Bounded Gap

Published:1999 Issue: Volume: Page:134-149
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Brodal Gerth Stølting,Lyngsø Rune B.,Pedersen Christian N. S.,Stoye Jens

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48452-3_11

Reference26 articles.

1. G.M. Adel’son-Vel’skii and Y.M. Landis. An algorithm for the organization of information. Doklady Akademii Nauk SSSR, 146:263–266, 1962. English translation in Soviet Math. Dokl., 3:1259-1262.

2. A. Apostolico and F.P. Preparata. Optimal off-line detection of repetitions in a string. Theoretical Computer Science, 22:297–315, 1983.

3. G.S. Brodal, R.B. Lyngsø, C.N.S. Pedersen, and J. Stoye. Finding maximal pairs with bounded gap. Technical Report RS-99-12, BRICS, April 1999.

4. M.R. Brown and R.E. Tarjan. A fast merging algorithm. Journal of the ACM, 26(2):211–226, 1979.

5. M. Crochemore. An optimal algorithm for computing the repetitions in a word. Information Processing Letters, 12(5):244–250, 1981.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Maximal Closed Substrings;String Processing and Information Retrieval;2022

2. Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes;Theory of Computing Systems;2017-08-15

3. A Faster Algorithm for Computing Maximal $$\alpha $$ -gapped Repeats in a String;String Processing and Information Retrieval;2015

4. Longest Gapped Repeats and Palindromes;Mathematical Foundations of Computer Science 2015;2015

5. Longest $$\alpha $$ α -Gapped Repeat and Palindrome;Fundamentals of Computation Theory;2015