Constructing maps using the span and inclusion relations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Constructing maps using the span and inclusion relations

Full text

Pdf (1.26 MB)

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: 64 - 73

Year of Publication: 1998

ISBN:0-89791-976-9

Authors

Dan Fasulo	Department of Computer Science and Engineering, University of Washington, Seattle, Washington
Tao Jiang	Department of Computer Science, McMaster University, Hamilton, Ontario LSS 4K1, Canada
Richard M. Karp	Department of Computer Science and Engineering, University of Washington, Seattle, Washington
Nitin Sharma	Department of Computer Science and Engineering, University of Washington, Seattle, Washington

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 7, Citation Count: 2

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.279090 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	D. Balding and D. Torney. Statistical analysis of DNA fmg~~t data for ordered clone physical mapping of human chromosomes. Bulletin of Mathematical Biology, 53(6), 1991, pp. 620--629.
	2	Daniel P. Fasulo , Tao Jiang , Richard M. Karp , Reuben Settergren , Edward C. Thayer, An algorithmic approach to multiple complete digest mapping, Proceedings of the first annual international conference on Computational molecular biology, p.118-127, January 20-23, 1997, Santa Fe, New Mexico, United States [doi>10.1145/267521.267538]
	3	IV. Gillet and j. Danes. DNA mapping algorithms: Synchronized double digest mapping. Technical report, IVashington University, 1993.
	4	IV. Ginet, L. ~, G. Wong, J. Yu, 1L Lim, and M. 01sore Assembly of high-resolution restriction maps based on multiple complete digests of a redundant set of overlapping clones. Genomics, 33, 389-408.
	5	l~~ Held and tL Karp. The traveling-salesman problem and minimum spa--i~g trees: Part IL Mathematical Pro~rammin9 1(1), 1971, pp. 6-25.
	6	T. Jiang and 1~ Karp. Mapping clones with a given ordering or interleaving. Algorithmica, in press.
	7	Brendan Marshall Mumey, Some computational problems from genomic mapping, University of Washington, Seattle, WA, 1998
	8	D. O. Nelson and T. P. Speed. Statistical issues in constructing high resolution physical maps. Statistical Science, 9(3), 1994, pp. 334-354.
	9	C. Soderlund, L Longden, and 1L Mott. FPC: A system for building contigs from restriction fmge~finted clones. CABIOS (13)5, 1997, pp. 523-535.
	10	J. Sulston, 17. Mallet, 1t. Staden, 1~ Durbin, T. Horsnell, and A. Coulson. Software for genome mapping by fingerprinting techniques. Comput. Applic. Biosei., 4, 125-132.
	11	G. Igrong, J. Yu, E. Thayer, and M. O1son. Multiplecomplete-digest l~est~ction Fragment Mappin~ Generating Sequence-ready maps for large-scale DNA sequencing. Proc_ of the National Academy of Sci. USA (1997), pp. 5225-5230.

CITED BY 2

	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
	Tomás Feder , Heikki Mannila , Evimaria Terzi, Approximating the Minimum Chain Completion problem, Information Processing Letters, v.109 n.17, p.980-985, August, 2009