Computing minimum length representations of sets of words of uniform length
From MaRDI portal
Publication:2355702
DOI10.1016/j.tcs.2015.06.038zbMath1328.68322WikidataQ115036536 ScholiaQ115036536MaRDI QIDQ2355702
Andrew Lohr, Francine Blanchet-Sadri
Publication date: 24 July 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.038
graph theory; combinatorics on words; partial words; algorithms on strings; subwords; representable sets
68R15: Combinatorics on words
68R10: Graph theory (including graph drawing) in computer science
68W32: Algorithms on strings
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On finding minimal length superstrings
- Mellin transforms and asymptotics: Digital sums
- Deciding representability of sets of words of equal length
- Sets Represented as the Length-n Factors of a Word
- Deciding Representability of Sets of Words of Equal Length in Polynomial Time
- Computing Minimum Length Representations of Sets of Words of Uniform Length
- Finding Minimum-Cost Circulations by Successive Approximation
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Number of Odd Binomial Coefficients
- On Pseudo-Random Arrays
- Algorithmic Combinatorics on Partial Words
- Depth-First Search and Linear Graph Algorithms