Optimal Bounds for Computing \(\alpha \)-gapped Repeats

  • Maxime Crochemore
  • Roman Kolpakov
  • Gregory Kucherov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9618)

Abstract

Following (Kolpakov et al., 2013; Gawrychowski and Manea, 2015), we continue the study of \(\alpha \)-gapped repeats in strings, defined as factors uvu with \(|uv|\le \alpha |u|\). Our main result is the \(O(\alpha n)\) bound on the number of maximal\(\alpha \)-gapped repeats in a string of length n, previously proved to be \(O(\alpha ^2 n)\) in (Kolpakov et al., 2013). For a closely related notion of maximal \(\delta \)-subrepetition (maximal factors of exponent between \(1+\delta \) and 2), our result implies the \(O(n/\delta )\) bound on their number, which improves the bound of (Kolpakov et al., 2010) by a \(\log n\) factor.

We also prove an algorithmic time bound \(O(\alpha n+S)\) (S size of the output) for computing all maximal \(\alpha \)-gapped repeats. Our solution, inspired by (Gawrychowski and Manea, 2015), is different from the recently published proof by (Tanimura et al., 2015) of the same bound. Together with our bound on S, this implies an \(O(\alpha n)\)-time algorithm for computing all maximal \(\alpha \)-gapped repeats.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Maxime Crochemore
    • 1
  • Roman Kolpakov
    • 2
  • Gregory Kucherov
    • 3
  1. 1.King’s College LondonLondonUK
  2. 2.Lomonosov Moscow State UniversityMoscowRussia
  3. 3.LIGM/CNRS, Université Paris-EstMarne-la-valléeFrance

Personalised recommendations