Algorithms for optical mapping

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithms for optical mapping

Full text

Pdf (882 KB)

Source

Annual Conference on Research in Computational Molecular Biology archive
Proceedings of the second annual international conference on Computational molecular biology table of contents

New York, New York, United States

Pages: 117 - 124

Year of Publication: 1998

ISBN:0-89791-976-9

Authors

Richard M. Karp	Department of Computer Science and Engineering, University of Washington, Seattle, WA
Ron Shamir	Department of Computer Science and Engineering, University of Washington, Seattle, WA and Department of Computer Science, Sackler Faculty of Exact Sciences, Tel Aviv University, Tel-Aviv 69978, Israel

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 13, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

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

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/279069.279104 What is a DOI?

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	T. S. Anantharaman, B. Mishra, and D. C. Schwartz. Oenomics via optical mapping II: Restriction maps. Yournal of Computational Biology, 4:91-118, 1997.
	2	W. Cai, H. Aburatasd, V. P. Stanton, D. E. Housman, Y. K. Wang, and D. C. Schwartz. Ordered restriction endonuclease maps of yeast artificial chromosomes created by optical mapping on surfaces. Proc. Natl. Acad. $ci. U.S.A., 92:5164-8, 1998.
	3	V. Dan~:fk, S. HannenhaUi, and S. Muthukrishnan. Hardness of flip-cut problems from optical mapping. Journal of Oomputational Biology, 4:119-125, 1997.
	4	W. Hoeffding. Probability inequalities for sums of boudned random variables. J. Am. Star. Ass., 58:13-30, 1963.
	5	Y. Kohaxa, K. Akiyama, and K. Isono. The physical map of the whole E. coli chromosome: application of a new strategy for rapid analysis and sorting of large genomic libraries. Cell, 50:495-508, 1987.
	6	X. Men~, K. Benson, K. Chada, E. 3. Huff, and D. C. Schwartz. Optical mapping of lambda bacteriophage clones using restriction endonucleases. Nature Genetics, 9:432-438, 1995.
	7	Rajeev Motwani , Prabhakar Raghavan, Randomized algorithms, Cambridge University Press, New York, NY, 1995
	8	S. Muthukrishnan , Laxmi Parida, Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach, Proceedings of the first annual international conference on Computational molecular biology, p.209-219, January 20-23, 1997, Santa Fe, New Mexico, United States [doi>10.1145/267521.267552]
	9	M. V. Olson et al. Random-done strategy for genomic restriction mapping in yeast. Proc. Nat. Acad. Sci. USA, 83:7826-7830, 1986.
	10	A. Samad, E. J. Huff, and D. C. Schwaxtz. Optical mapping: A novel, single-molecule approach to genomic analysis. Genome Rsearch, ~5(1), 1995.
	11	H. Samad, W. W. Cai, X. Hu, B. Irvin, J..ling, J. Reed, X. Meng, J. Huang, E. Huff, B. Porter, et al. Mapping the genome one molecule at a time-optical mapping. Nature, 378:516-517, 1995.
	12	D. C. Schwartz, X. Li, L. L Hernandez, S. P. Ramnarain, E. J. Huff, and Y. K. Wang. Ordered restriction maps of sacchaxomyces cerevisiae chromosomes constructed by optical mapping. Scien.ce, 262:110-114, 1993.

CITED BY 4

	John Krececioglu , Sanjay Shete , Jonathan Arnold, Reconstructing distances in physical maps of chromosomes with nonoverlapping probes, Proceedings of the fourth annual international conference on Computational molecular biology, p.183-192, April 2000, Tokyo, Japan
	Gopal Pandurangan , H. Ramesh, The restriction mapping problem revisited, Journal of Computer and System Sciences, v.65 n.3, p.526-544, November 2002
	Jacek Blazewicz , Marta Kasprzak, On the complexity of the DNA simplified partial digest problem, Proceedings of the 12th Computing: The Australasian Theroy Symposium, p.93-100, January 16-19, 2006, Hobart, Australia
	Thomas Christof , John Kececioglu, Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut, Proceedings of the third annual international conference on Computational molecular biology, p.115-123, April 11-14, 1999, Lyon, France