Advertisement

Subsequence Packing: Complexity, Approximation, and Application

  • Minghui Jiang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4041)

Abstract

We study the subsequence packing problem: given a string T and a collection of strings {S i }, find disjoint subsequences {T i } of T with maximum total length such that each T i is a subsequence of S i . 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.

Keywords

Greedy Algorithm Approximation Ratio Optimal Packing Longe Common Subsequence Binary Alphabet 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., Walter, P.: Molecular Biology of the Cell, 4th edn. Garland Science (2002)Google Scholar
  2. 2.
    Anderson, E.J., Jayram, T.S., Kimbrel, T.: Tighter bounds on preemptive job shop scheduling with two machines. Computing 67(1), 83–90 (2001)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bansal, N., Kimbrel, T., Sviridenko, M.: Job shop scheduling with unit processing times. In: Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 207–214 (2005)Google Scholar
  4. 4.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)MATHGoogle Scholar
  5. 5.
    Gonzalez, T., Sahni, S.: Flowshop and jobshop schedules: complexity and approximation. Operations Research 26, 36–52 (1978)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)MATHCrossRefGoogle Scholar
  7. 7.
    Kimbrel, T., Saia, J.: Online and offline preemptive two-machine job shop scheduling. Journal of Scheduling 3, 355–364 (2000)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Sevastianov, S.V., Woeginger, G.J.: Makespan minimization in preemptive two machine job shops. Computing 60(1), 73–80 (1998)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Venter, J.C., Adams, M.D., Myers, E.W., et al.: The sequence of the human genome. Science 291(5507), 1304–1351 (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Minghui Jiang
    • 1
  1. 1.Department of Computer ScienceUtah State UniversityLoganUSA

Personalised recommendations