Partitioning K clones

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Partitioning K clones: hardness results and practical algorithms for the K-populations problem

Full text

Pdf (1.06 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: 192 - 201

Year of Publication: 1998

ISBN:0-89791-976-9

Authors

Laxmi Parida	Courant Institute, New York University, 251 Mercer St, NYC, NY
Bud Mishra	Courant Institute, New York University, 251 Mercer St, NYC, NY

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

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

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

	AMS97	T.S. ANANTHARAMAN, B. MISHEA AND D.C. SCHWAETZ, "Genomics via Optical Mapping II: Ordered Restriction Maps," Journal of Computational Biology,4(2):91-118, 1997.
	AL97	Sanjeev Arora , Carsten Lund, Hardness of approximations, Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, MA, 1996
	Cai+95	W. CAI ET AL., "Ordered Restriction Endonuclease Maps of Yeast Artificial Chromosomes Created by Optical Mapping on Surfaces," Proc. Natl. Acad. Sci., USA, 92:5164-5168, 1995.
	DHM97	V. DAN~/K, $. HA~- NEHALLI AND S. MUTHUKRISHNAN, "Hardness of Flip-Cut Problems for Optical Mapping," Journal of Uomputational Biology,4(2), 1997.
	GJ79	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	GP96	D. Geiger , L. Parida, A Model and Solution to the DNA Flipping String Problem, New York University, New York, NY, 1996
	GW94	Michel X. Goemans , David P. Williamson, .879-approximation algorithms for MAX CUT and MAX 2SAT, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.422-431, May 23-25, 1994, Montreal, Quebec, Canada [doi>10.1145/195058.195216]
	Men+95	X. MENG ET AL., "Optical Mapping of Lambda Bacteriophage Clones Using RestTicton Endonuclease,~ Nature Genetics, 9:432-438, 1995.
	MP96	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]
	Par97a	L. Parida, Inapproximability of Flip-Cut, Shift-Cut and Other Problems from Optical Mapping, New York University, New York, NY, 1997
	Par97b	L. Parida, A Uniform Framework for Ordered Restriction Map Problems, New York University, New York, NY, 1997
	Sam+95	A. SAI~AD ET AL., "Mapping the Genome One Molecule At a Time--Optical Mapp'mg,' Nature, 378:516-517, 1995.
	Sch+93	D.C. SCmVAR~Z sr AL., "Ordered Restriction Maps of Saccharomyces cerevisiae Chromosomes Constructed by Optical Mappingf Science, 262:110-114, 1993.
	WHS95	Y.K. WANG, E.J. HUFF AND D.C. SCmVARTZ, "Optcal Mapping of the Sitedirected Cleavages on Single DNA Molecules by the RecA-assisted Restndcfion Eudonndease Techniquef In Proc. Natl. Acad. Sci. USA, 92:165-169, 1995.
	WSK84	M.S. WATER- x~w, T.F. SMITH AND H. KATCHER, "A}goritkms for Restriction Map Comparisonsf Nucleic Acids Research, 12: 237-242, 1984.
	Wat95	M.S. WATERMAN, An Introduction to Compurational Biology: Maps, Sequences and Genomes, Chapman I-Ia~ 1995.