Searching of gapped repeats and subrepetitions in a word
Authors:
- Roman KolpakovRKRoman Kolpakov
- Mikhail PodolskiyMPMikhail Podolskiy
- Mikhail PosypkinMPMikhail Posypkin
- Nickolay KhrapovNKNickolay Khrapov
- 1 September 2017
- journal article
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 46-47, 1-15
Abstract
No abstract availableAll Related Versions
Funding Information
- Russian Foundation for Fundamental Research (15-07-03102)
This publication has 9 references indexed in Scilit:
- Extracting powers and periods in a word from its runs structureTheoretical Computer Science, 2014
- On the maximal sum of exponents of runs in a stringJournal of Discrete Algorithms, 2012
- On primary and secondary repetitions in wordsTheoretical Computer Science, 2012
- On maximal repetitions of arbitrary exponentInformation Processing Letters, 2010
- Linear time algorithms for finding and representing all the tandem repeats in a stringJournal of Computer and System Sciences, 2004
- Squares, cubes, and time-space efficient string searchingAlgorithmica, 1995
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976