2D Lyndon words and applications
From MaRDI portal
Publication:513297
DOI10.1007/s00453-015-0065-zzbMath1362.68240arXiv1301.0103OpenAlexW2097540673MaRDI QIDQ513297
Publication date: 6 March 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.0103
periodicitymodular arithmeticLyndon wordtwo-dimensional wordssuffix-prefix matching, two-dimensional dictionary problem
Related Items (6)
Lyndon words formalized in Isabelle/HOL ⋮ Multidimensional period recovery ⋮ Lyndon partial words and arrays with applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two-dimensional maximal repetitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
- Nontrivial lower bounds for the least common multiple of some finite sequences of integers
- An efficient algorithm for the all pairs suffix-prefix problem
- Two-dimensional dictionary matching
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Periodic musical sequences and Lyndon words
- Multiple matching of rectangular patterns
- Succinct 2D dictionary matching
- Efficient string matching
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
- Algorithms on Strings, Trees and Sequences
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- Fast parallel Lyndon factorization with applications
- Two-Dimensional Periodicity in Rectangular Arrays
- A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
- Parallel Suffix–Prefix-Matching Algorithm and Applications
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- A new characterization of maximal repetitions by Lyndon trees
- Lyndon Words and Short Superstrings
- On Burnside's Problem
This page was built for publication: 2D Lyndon words and applications
