Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats-Reference-Cited by-同舟云学术

Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats

Published:2016 Issue: Volume: Page:245-255
ISSN:0302-9743
Container-title:Language and Automata Theory and Applications
language:
Short-container-title:

Author:

Crochemore Maxime,Kolpakov Roman,Kucherov Gregory

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-30000-9_19

Reference27 articles.

1. Lecture Notes in Computer Science;G Badkobeh,2012

2. Bannai, H., Tomohiro, I., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: A new characterization of maximal repetitions by Lyndon trees, intermediate version presented to SODA’2015 (2014). CoRR abs/1406.0263

3. Breslauer, D.: Efficient string algorithmics. Ph.D. thesis, Columbia University (1992)

4. Brodal, G.S., Lyngs, R.B., Pedersen, C.N.S., Stoye, J.: Finding maximal pairs withbounded gap. J. Discrete Algorithms 1(1), 77–104 (2000)

5. Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inf. Process. Lett. 12(5), 244–250 (1981)

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

1. Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings;International Journal of Foundations of Computer Science;2022-11-22

2. Some results on the possible number of periodic factors in words;Mathematical Problems of Cybernetics;2022

3. Efficient representation and counting of antipower factors in words;Information and Computation;2021-06

4. The undirected repetition threshold and undirected pattern avoidance;Theoretical Computer Science;2021-04

5. Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings;Developments in Language Theory;2021