Longest Lyndon Substring After Edit
From MaRDI portal
Publication:5140783
DOI10.4230/LIPIcs.CPM.2018.19zbMath1497.68607OpenAlexW2803677363MaRDI QIDQ5140783
Shunsuke Inenaga, Yuki Urabe, Hideo Bannai, Masayuki Takeda, Yuto Nakashima
Publication date: 16 December 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2018.19
Related Items (8)
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 ⋮ Data structures for computing unique palindromes in static and non-static strings ⋮ Near-optimal quantum algorithms for string problems ⋮ Dynamic and internal longest common substring ⋮ Computing longest palindromic substring after single-character or block-wise edits ⋮ Faster queries for longest substring palindrome after block edit
Uses Software
Cites Work
- Unnamed Item
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
- Minimal non-convex words
- The level ancestor problem simplified
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Parallel RAM algorithms for factorizing words
- Lyndon words, permutations and trees.
- Reconstructing a string from its Lyndon arrays
- The standard factorization of Lyndon words: an average point of view
- Periodic musical sequences and Lyndon words
- On-line construction of suffix trees
- Simple Real-Time Constant-Space String Matching
- Factorizing words over an ordered alphabet
- Fast Algorithms for Finding Nearest Common Ancestors
- Two-way string-matching
- Fast parallel Lyndon factorization with applications
- Longest Common Factor After One Edit Operation
- The “Runs” Theorem
- Lyndon Words and Short Superstrings
- On Burnside's Problem
- Free differential calculus. IV: The quotient groups of the lower central series
This page was built for publication: Longest Lyndon Substring After Edit
