Physical mapping of chromosomes: A combinatorial problem in molecular biology
- 142 Downloads
This paper is concerned wth the physical mapping of DNA molecules using data about the hybridization of oligonucleotide probes to a library of clones. In mathematical terms, the DNA molecule corresponds to an interval on the real line, each clone to a subinterval, and each probe occurs at a finite set of points within the interval. A stochastic model for the occurrences of the probes and the locations of the clones is assumed. Given a matrix of incidences between probes and clones, the task is to reconstruct the most likely interleaving of the clones. Combinatorial algorithms are presented for solving approximations to this problem, and computational results are presented.
Key wordsClone DNA Local search Maximum likelihood Oligonucleotide Physical mapping Probe Traveling-salesman problem
Unable to display preview. Download preview PDF.
- [BJL+]A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis. Linear approximation of shortest superstrings.Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 328–336, New Orleans, LA, May 1991. ACM Press, New York.Google Scholar
- [CdJ+]A. V. Carrano, P. J. de Jong, E. Branscomb, T. Slezak, and B. Watkins. Constructing chromosome- and region-specific cosmid maps of the human genome.Genome,31(2), 1059–1065, 1989.Google Scholar
- [LK]S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling-salesman problem.Operations Research,21(2), March–April 1973.Google Scholar