Algorithms for optimizing production DNA sequencing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithms for optimizing production DNA sequencing

Full text

Pdf (999 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms table of contents

San Francisco, California, United States

Pages: 399 - 408

Year of Publication: 2000

ISBN:0-89871-453-2

Authors

Eva Czabarka	Department of Mathematics, University of South Carolina, Columbia, SC
Goran Konjevod	Mathematical Sciences Department, Carnegie Mellon University, Wean Hall, Pittsburgh, PA and TRANSIMS, MS-M997, Los Alamos National Laboratory, Los Alamos, NM
Madhav V. Marathe	Computer Research and Applications Group CIC-3, MS-P990, Los Alamos National Laboratory, Los Alamos, NM
Allon G. Percus	Computer Research and Applications Group CIC-3, MS-B265, Los Alamos National Laboratory, Los Alamos, NM
David C. Torney	Theoretical Biology and Biophysics Group (T-10) and Center for Human Genome Studies, MS-K710, Los Alamos National Laboratory, Los Alamos, NM

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 13, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	F. Alizadeh, R.M. Kaxp, L.A. Newberg and D.K. Weisser, Physical mapping of chromosomes: a combinatorial problem in mathematical biology, Algorithmica, 13 (1995), pp. 52-76.
	2	S. Anderson, M.H. de Bruijn, A.R. Coulson, I.C. Eperon, F. Sanger, and I.G. Young, Complete sequence of bovine mitochondrial DNA. Conserved features of the mammalian mitochondrial genome, J. Mol. Biol., 156 (1992), pp. 683-717.
	3	D. Gordon, C. Abajian, and P. Green, Consed: A graphical tool for sequence finishing, Genome Research, 8 (1998), pp. 195-202.
	4	Human Genome Program, U.S. Department of Energy, JGI and "Bermuda-quality" sequence, Human Genome News, 9:3 (1998), p. 7, at: http://w~.ornl.gov/ hgn~s/publtcat/hgn}vgn3/OTbermud.htn~. See also: http ://~v. gene. ucl. ac. uk/hugo/bermuda2, htm.
	5	F. Sanger, S. Nicklen and A.R. Coulson, DNA sequencing ~oith chain-terminating inhibitors, Proc. Nat. Acad. Sci. USA, 74 (1977), pp. 5463-5467.
	6	J.D. Watson and F.H.C. Crick, A structure for deoxyribose nucleic acid, Nature, 171 (1953), pp. 737-738.
	7	J.D. Watson, N.H. Hopkins, J.W. Roberts, J.A. Steitz and A.M. Wiener, Molecular Biology of the Gene, Fourth Edition, Vol. I, Benjamin/Cummings, Menlo Park, NJ, 1987.

CITED BY 2

	David Hart, An optimal (expected time) algorithm for minimizing lab costs in DNA sequencing, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.885-893, January 06-08, 2002, San Francisco, California
	Degui Zhi , Uri Keich , Pavel Pevzner , Steffen Heber , Haixu Tang, Correcting Base-Assignment Errors in Repeat Regions of Shotgun Assembly, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), v.4 n.1, p.54-64, January 2007