Subsequence Packing: Complexity, Approximation, and Application

We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a subsequence of Si. We prove the NP-completeness of the decision problem, present the first non-trivial deterministic approximation, and show its applications to DNA sequencing verification and preemptive job shop scheduling with two machines.

• Type: Conference
• Year: 2006
• Where: AAIM
• Authors: Minghui Jiang
• Keywords: AAIM 2006, Algorithms, Maximum Total Length, Non-trivial Deterministic Approximation, Subsequence Packing Problem