Genomics via Optical Mapping II: Ordered Restriction Maps

In this paper, we describe our algorithmic approach to constructing ordered restriction maps based on the data created from the images of population of individual DNA molecules (clones) digested by restriction enzymes. The goal is to devise map-making algorithms capable of producing high-resolution, high-accuracy maps rapidly and in a scalable manner. The resulting software is a key component of our optical mapping automation tools and has been used routinely to map cosmid, lambda and BAC clones. The experimental results appear highly promising.

[1]  D. Schwartz,et al.  Optical mapping of site-directed cleavages on single DNA molecules by the RecA-assisted restriction endonuclease technique. , 1995, Proceedings of the National Academy of Sciences of the United States of America.

[2]  H. Aburatani,et al.  Ordered restriction endonuclease maps of yeast artificial chromosomes created by optical mapping on surfaces. , 1995, Proceedings of the National Academy of Sciences of the United States of America.

[3]  E. Lander,et al.  Genomic mapping by fingerprinting random clones: a mathematical analysis. , 1988, Genomics.

[4]  M. Waterman,et al.  Optimizing restriction fragment fingerprinting methods for ordering large genomic libraries. , 1990, Genomics.

[5]  D. Schwartz,et al.  Ordered restriction maps of Saccharomyces cerevisiae chromosomes constructed by optical mapping. , 1993, Science.

[6]  M. Waterman,et al.  The accuracy of DNA sequences: estimating sequence quality. , 1992, Genomics.

[7]  Haim Kaplan,et al.  Four Strikes Against Physical Mapping of DNA , 1995, J. Comput. Biol..

[8]  D. Barker,et al.  Restriction sites containing CpG show a higher frequency of polymorphism in human DNA , 1984, Cell.

[9]  Michael I. Miller,et al.  REPRESENTATIONS OF KNOWLEDGE IN COMPLEX SYSTEMS , 1994 .

[10]  Eric S. Lander.  Mapping Heredity : Using Probabilistic Models and Algorithms to Map Genes and Genomes , 1995 .

[11]  V. Rao Vemuri,et al.  Multiniche Crowding in Genetic Algorithms and Its Application to the Assembly of DNA Restriction-Fragments , 1994, Evolutionary Computation.

[12]  E. Dimalanta,et al.  Mapping the genome one molecule at a time — optical mapping , 1995, Nature.

[13]  M. Waterman,et al.  Mapping DNA by stochastic relaxation , 1987 .

[14]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[15]  T. Anantharaman,et al.  High-resolution restriction maps of bacterial artificial chromosomes constructed by optical mapping. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[16]  M Krawczak.  Algorithms for the restriction-site mapping of DNA molecules. , 1988, Proceedings of the National Academy of Sciences of the United States of America.

[17]  Laxmi Parida,et al.  Towards constructing physical maps by optical mapping: an effective, simple, combinatorial approach , 1997, RECOMB 1997.

[18]  D. Schwartz,et al.  Optical mapping of lambda bacteriophage clones using restriction endonucleases , 1995, Nature Genetics.

[19]  X. Huang,et al.  Dynamic programming algorithms for restriction map comparison , 1992, Comput. Appl. Biosci..

[20]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[21]  Gary A. Churchill.  Monte Carlo sequence alignment , 1997, RECOMB '97.