Sciweavers

Share
AAIM
2006
Springer
75views Algorithms» more  AAIM 2006»
9 years 8 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 ...
Minghui Jiang
books