Algorithms for computing and integrating physical maps using unique probes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithms for computing and integrating physical maps using unique probes

Full text

Pdf (1.14 MB)

Source

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

Santa Fe, New Mexico, United States

Pages: 151 - 161

Year of Publication: 1997

ISBN:0-89791-882-7

Authors

Mudita Jain	Dept. of Computer Science, University of Arizona, Tucson, AZ
Eugene W. Myers	Dept. of Computer Science, University of Arizona, Tucson, AZ

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
DOE : Department of Energy

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 6, 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/267521.267542 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.

	AKWZ95	Farid Alizadeh , Richard M. Karp , Deborah K. Weisser , Geoffrey Zweig, Physical mapping of chromosomes using unique probes, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.489-500, January 23-25, 1994, Arlington, Virginia, United States
	ALTW91	Richard Arratia, Eric S. Lander, Simon Tavare, and Michael S. Waterson. Genomic mapping by anchoring random clones: A mathematical analysis. Genornics, 11:806-827', 1991.
	BL76	Kellogg S. Booth and George S. Leuker. Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comp. and Syst. Sci., 13:335-379, 1976.
	GKS94	Martin Charles Golumbic , Haim Kaplan , Ron Shamir, On the complexity of DNA physical mapping, Advances in Applied Mathematics, v.15 n.3, p.251-261, Sept. 1994 [doi>10.1006/aama.1994.1009]
	JM95	Mudita Jain and Eugene W. Myers. A note on scoring clones given a probe ordering. Journal of Computational Biology, 2:33-37, 1995.
	JRT95	Michael J/inger, Gerhard Reinelt, and Stefan Theinel. Practical problem solving with cutting plane algorithms in combinatorial optimization. DIMA CS Series in Discrete Mathematics, 20:111-152, 1995.
	Kou77	Lawrence T. Kou. Polynomial complete consecutive information retrieval problems. SIAM Journal on Computing, 6(1):67-75, March 1977.
	Opa79	J. cpatrny. Total ordering problem. SIAM Journal of Computing, 8:111-114, 1979.
	Rei85	Gerhard Reinelt. The Linear Ordering Problem: Algorithms and Applications. Helderman Verlag, Berlin, 1985.
	RT87	Prabhakar Raghavan , Clark D. Tompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica, v.7 n.4, p.365-374, Dec, 1987 [doi>10.1007/BF02579324]
	Shm95	David B. Shmoys. Computing near-optimal solutions to combinatorial optimization problems. DIMA CS Series in Discrete Mathematics and Theoretical Computer Science, 20:355-397, 1995.

CITED BY 2

	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
	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