Subsequence Packing: Complexity, Approximation, and Application

DOI10.1007/11775096_29MaRDI QIDQ5434409zbMATH OpenOpenAlexFDO

Authors Minghui Jiang

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11775096_29

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Deterministic scheduling theory in operations research (90B35) Combinatorics on words (68R15)

Recommendations

• Maximal common subsequences and minimal common supersequences
• Complexity of approximating closest substring problems.
• Consistent subsequences and supersequences
• Constrained LCS: Hardness and Approximation
• Combined super-/substring and super-/subsequence problems

Cited in

(3)

• Complexity of min-max subsequence problems
• Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
• The maximum equality-free string factorization problem: gaps vs. no gaps

This page was built for publication: Subsequence Packing: Complexity, Approximation, and Application

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