Factorizing strings into repetitions
From MaRDI portal
Publication:2135631
DOI10.1007/s00224-022-10070-3OpenAlexW4223516538MaRDI QIDQ2135631
Shunsuke Inenaga, Hiroe Inoue, Yuto Nakashima, Hideo Bannai, Yoshiaki Matsuoka, Masayuki Takeda
Publication date: 9 May 2022
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-022-10070-3
Algorithms in computer science (68Wxx) Theory of data (68Pxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Closed factorization
- A subquadratic algorithm for minimum palindromic factorization
- Computing longest previous factor in linear time and applications
- The exact number of squares in Fibonacci words
- Searching of gapped repeats and subrepetitions in a word
- Squares, cubes, and time-space efficient string searching
- Constructing LZ78 tries and position heaps in linear time for large alphabets
- On Prefix/Suffix-Square Free Words
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String
- Factorizing words over an ordered alphabet
- Data compression via textual substitution
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Diverse Palindromic Factorization is NP-Complete
- Palindromic length in linear time
- Computing Palindromic Factorizations and Palindromic Covers On-line
- Uniqueness Theorems for Periodic Functions
- The “Runs” Theorem
- Factorizing a String into Squares in Linear Time
- Free differential calculus. IV: The quotient groups of the lower central series
This page was built for publication: Factorizing strings into repetitions
