scientific article; zbMATH DE number 7651171
From MaRDI portal
Publication:5874500
DOI10.4230/LIPIcs.ESA.2020.32MaRDI QIDQ5874500
Wiktor Zuba, Panagiotis Charalampopoulos, Wojciech Rytter, Jakub Radoszewski, Tomasz Walen
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2006.15999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Lower bounds for the number of repetitions in 2D strings ⋮ Two-dimensional Fibonacci words: tandem repeats and factor complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extracting powers and periods in a word from its runs structure
- The total run length of a word
- How many double squares can a string contain?
- On the density of Lyndon roots in factors
- 2D Lyndon words and applications
- The ``runs conjecture
- Maximal repetitions in strings
- How many runs can a string contain?
- An optimal algorithm for computing the repetitions in a word
- How many squares can a string contain?
- A characterization of the squares in a Fibonacci string
- Fibonacci arrays and their two-dimensional repetitions
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Squares, cubes, and time-space efficient string searching
- On-line construction of suffix trees
- Two-dimensional maximal repetitions
- A note on the number of squares in a word
- The number of runs in a string
- Optimal discovery of repetitions in 2D
- Analysis of Maximal Repetitions in Strings
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
- Not So Many Runs in Strings
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- Jewels of Stringology
- Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
- Repetition Detection in a Dynamic String
- String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
- Uniqueness Theorems for Periodic Functions
- The “Runs” Theorem
- Internal Pattern Matching Queries in a Text and Applications
- Algorithms on Strings
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
- Simple and flexible detection of contiguous repeats using a suffix tree
This page was built for publication:
