The maximum equality-free string factorization problem: gaps vs. no gaps

DOI10.1007/978-3-030-38919-2_43MaRDI QIDQ3297782zbMATH OpenOpenAlexFDO

Authors

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

equality-freeheuristicsstring algorithmsstring factorization

Mathematics Subject Classification ID

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

Recommendations

• Computing equality-free string factorisations
• Computing equality-free and repetitive string factorisations
• String factorisations with maximum or minimum dimension
• Forbidden Factors and Fragment Assembly
• Subsequence Packing: Complexity, Approximation, and Application

Cites work

• Compression of individual sequences via variable-rate coding
• Computing equality-free and repetitive string factorisations
• Multivariate algorithmics for NP-hard string problems
• On the approximability of an interval scheduling problem
• Pattern matching with variables: fast algorithms and new hardness results
• The complexity of string partitioning

Cited in

(4)

• String factorisations with maximum or minimum dimension
• Computing equality-free and repetitive string factorisations
• Computing equality-free string factorisations
• Maximal and minimal representations of gapped and non-gapped motifs of a string

This page was built for publication: The maximum equality-free string factorization problem: gaps vs. no gaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297782)