Computing Minimum Length Representations of Sets of Words of Uniform Length

DOI10.1007/978-3-319-19315-1_7zbMath1396.68082OpenAlexW948874132MaRDI QIDQ2946043

Andrew Lohr, Francine Blanchet-Sadri

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_7

Mathematics Subject Classification ID

Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10) Algorithms on strings (68W32)

Related Items (1)

Computing minimum length representations of sets of words of uniform length

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
• 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
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Computing Minimum Length Representations of Sets of Words of Uniform Length