Sciweavers

Share
AAIM
2006
Springer

Subsequence Packing: Complexity, Approximation, and Application

9 years 7 months ago
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.
Minghui Jiang
Added 13 Jun 2010
Updated 13 Jun 2010
Type Conference
Year 2006
Where AAIM
Authors Minghui Jiang
Comments (0)
books