Skip to main content
SpringerLink
Log in

The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper, we propose the incremental group testing model for the gap closing problem, which assumes that we can tell the difference between the outcome of testing a subset S, and the outcome of testing S ∪ {x}. We also give improvements over currently best results in literature for some other models.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Beigel, N. Alon, S. Kasif, M.S. Apaydin, and L. Fortnow, “An optimal procedure for gap closing in whole genome shotgun sequencing,” in Proceedings of the Fifth Annual International Conference on Computational Biology, Montreal, Quebec, Canada, 2001, pp. 22–30.

  2. L.J. Burgart, R.A. Robinson, M.J. Heller, W.W. Wilke, O.K. Iakoubova, and J.C. Cheville, “Multiplex polymerase chain reaction,” Mod. Pathol., vol. 5, pp. 320–323, 1992.

    Google Scholar 

  3. P. Damaschke, “A tight upper bound for group testing in graphs,” Discrete Applied Math., vol. 48, pp. 101–109, 1994.

    Google Scholar 

  4. D.-Z. Du and F.K. Hwang, Combinatorial Group Testing and its Applications, Series on Applied Mathematics, 2nd ed. World Scientific: Singapore, 2000.

    Google Scholar 

  5. V. Grebinski and G. Kucherov, “Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping,” Discrete Applied Math., vol. 88, pp. 147–165, 1998.

    Google Scholar 

  6. V. Grebinski and G. Kucherov, “Optimal reconstruction of graphs under the additive model,” Algorithmica, vol. 28, pp. 104–124, 2000.

    Google Scholar 

  7. M. Hell, Combinatorial Theory, 2nd ed. Wiler Interscience: New York, 1996.

    Google Scholar 

  8. P. Johann, “Agroup testing problem for graphs with several defective edges,” Discrete Applied Math., vol. 117, pp. 99–108, 2002.

    Google Scholar 

  9. B. Lindstrom, “On a combinatorial problem in number theory,” Canad. Math. Bull., vol. 8, pp. 261–265, 1965.

    Google Scholar 

  10. B. Lindstrom, “Determination of two vectors from the sum,” J. Combin. Thy., vol. A6, pp. 402–407, 1969.

    Google Scholar 

  11. J. Nagura, “On the interval containing at least one prime number,” Proc. Japan Acad., vol. 28, pp. 177–181, 1952.

    Google Scholar 

  12. A. Sorokin, A. Lapidus, V. Capuano, N. Galleron, P. Pujic, and S.D. Ehrlich, “A new approach using multiplex long accurate PCR and yeast artifical chromosomes for bacterial chromosome mapping and sequencing,” Genome Res., vol. 6, pp. 448–453, 1996.

    Google Scholar 

  13. G. Tenenbaum, The Prime Numbers and Their Distribution. AMS: USA, 2000.

    Google Scholar 

  14. H. Tettelin, D. Radune, S. Kasif, H. Khouri, and S.L. Salzberg, “Optimized multiplex PCR: Efficiently closing a whole-genome shotgun sequencing project,” Genomics., vol. 62, pp. 500–507, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, National Chiao Tung University, HsinChu, 30050, Taiwan, Republic of China

    Frank K. Hwang

  2. Institute of Information Science, Academia Sinica, 128, Academia Road, Sec. 2, Taipei, Taiwan, 115

    Wen-Dar Lin

Authors
  1. Frank K. Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wen-Dar Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hwang, F.K., Lin, WD. The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules. Journal of Combinatorial Optimization 7, 327–337 (2003). https://doi.org/10.1023/B:JOCO.0000017381.11696.c6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOCO.0000017381.11696.c6

Search

Navigation