Periodicity and Repetitions in Parameterized Strings
From MaRDI portal
Publication:3439251
DOI10.1016/j.endm.2005.07.030zbMath1158.94375OpenAlexW2177150369MaRDI QIDQ3439251
Alberto Apostolico, Raffaele Giancarlo
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2005.07.030
Combinatorics on words (68R15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cites Work
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Structural properties of the string statistics problem
- String overlaps, pattern matching, and nontransitive games
- Optimal off-line detection of repetitions in a string
- Alphabet dependence in parameterized matching
- Data structures and algorithms for the string statistics problem
- Parameterized pattern matching: Algorithms and applications
- A characterization of the centralizer of a permutation.
- On improving the worst case running time of the Boyer-Moore string matching algorithm
- The Boyer–Moore–Galil String Searching Strategies Revisited
- Algorithms on Strings, Trees and Sequences
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Two-Dimensional Periodicity in Rectangular Arrays
- Sparse Dynamic Programming for Longest Common Subsequence from Fragments
- Uniqueness Theorems for Periodic Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Periodicity and Repetitions in Parameterized Strings
