The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps

DOI10.1007/978-3-030-38919-2_43zbMath1440.68344OpenAlexW2999744948MaRDI QIDQ3297782

No author found.

Publication date: 20 July 2020

Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-38919-2_43

zbMATH Keywords

heuristicsstring algorithmsstring factorizationequality-free

Mathematics Subject Classification ID

Approximation algorithms (68W25) Algorithms on strings (68W32)

Cites Work

• On the approximability of an interval scheduling problem
• The complexity of string partitioning
• Computing equality-free and repetitive string factorisations
• Compression of individual sequences via variable-rate coding
• Unnamed Item
• Unnamed Item

This page was built for publication: The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps