Repetition Detection in a Dynamic String
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3976360
- Periodicity and repetitions in parameterized strings
- Publication:4351065
- Analysis of Maximal Repetitions in Strings
- Hunting redundancies in strings
- Efficient on-line repetition detection
- Understanding maximal repetitions in strings
- Factorizing strings into repetitions
- Maximal repetitions in strings
Cites work
- Algorithms on Strings
- An O(n log n) algorithm for finding all repetitions in a string
- An optimal algorithm for computing the repetitions in a word
- Dynamic dictionary matching in external memory
- Dynamic dictionary matching with failure functions
- Dynamic orthogonal range searching on the RAM, revisited
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Dynamic text and static pattern matching
- Dynamic Text Indexing under String Updates
- Efficient randomized pattern-matching algorithms
- Extracting powers and periods in a word from its runs structure
- Faster queries for longest substring palindrome after block edit
- scientific article; zbMATH DE number 1003303 (Why is no real title available?)
- scientific article; zbMATH DE number 3551946 (Why is no real title available?)
- scientific article; zbMATH DE number 6850408 (Why is no real title available?)
- Improved dynamic dictionary matching
- Internal pattern matching queries in a text and applications
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Locally maximal common factors as a tool for efficient dynamic string algorithms
- Longest common factor after one edit operation
- Longest common substring made fully dynamic
- Longest substring palindrome after edit
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- Optimal off-line detection of repetitions in a string
- The ``runs theorem
- The heaviest induced ancestors problem revisited
- Uniqueness Theorems for Periodic Functions
Cited in
(20)- Multidimensional period recovery
- Minimal unique palindromic substrings after single-character substitution
- The heaviest induced ancestors problem: better data structures and applications
- Shortest unique palindromic substring queries in semi-dynamic settings
- Dynamic and internal longest common substring
- Computing longest palindromic substring after single-character or block-wise edits
- Longest common substring made fully dynamic
- The number of repetitions in 2D-strings
- scientific article; zbMATH DE number 7765421 (Why is no real title available?)
- Data structures for computing unique palindromes in static and non-static strings
- Near-optimal quantum algorithms for string problems
- Internal pattern matching queries in a text and applications
- Dynamic longest common substring in polylogarithmic time
- A textbook solution for dynamic strings
- Shortest cover after edit
- Searching 2D-strings for matching frames
- Internal pattern matching in small space and applications
- Minimal generators in optimal time
- Counting distinct square substrings in sublinear time
- Efficient on-line repetition detection
This page was built for publication: Repetition Detection in a Dynamic String
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075738)
