Finding Maximal Pairs with Bounded Gap

@inproceedings{Brodal1999FindingMP,
  title={Finding Maximal Pairs with Bounded Gap},
  author={Gerth St{\o}lting Brodal and Rune B. Lyngs{\o} and Christian N. S. Pedersen and Jens Stoye},
  booktitle={CPM},
  year={1999}
}
A pair in a string is the occurrence of the same substring twice. A pair is maximal if the two occurrences of the substring cannot be extended to the left and right without making them different. The gap of a pair is the number of characters between the two occurrences of the substring. In this paper we present methods for finding all maximal pairs under various constraints on the gap. In a string of length n we can find all maximal pairs with gap in an upper and lower bounded interval in time… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 55 CITATIONS, ESTIMATED 89% COVERAGE

Longest Gapped Repeats and Palindromes

  • Discrete Mathematics & Theoretical Computer Science
  • 2015
VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Locating Maximal Multirepeats in Multiple Strings Under Various Constraints

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

“Algorithms & Combinatorics of Repetitions in Strings”

Toopsuwan
  • 2016
VIEW 8 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Optimal searching of gapped repeats in a word

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1999
2018

CITATION STATISTICS

  • 7 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 30 REFERENCES