Skip Navigation

This Article
Right arrow Full Text (Print PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cuticchia, A.J.
Right arrow Articles by Timberlake, W.E.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Cuticchia, A.J.
Right arrow Articles by Timberlake, W.E.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

ODS: ordering DNA sequences—a physical mapping algorithm based on simulated annealing

A.J. Cuticchia , J. Arnold 1,2 and W.E. Timberlake 1

Genome Data Base, The Johns Hopkins School of Medicine Baltimore, MD 21205
1Department of Genetics, The University of Georgia Athens, GA 30602, USA

2To whom reprint requests should be sent

In the program ODS we provide a methodology for quickly ordering random clones into a physical map. The process of ordering individual clones with respect to their position along a chromosome is based on the similarity of binary signatures assigned to each clone. This binary signature is obtained by hybridizing each clone to a panel of oligonucleotide probes. By using the fact that the amount of overlap between any two clones is reflected in the similarity of their binary signatures, it is possible to reconstruct a chromosome by minimizing the sum of linking distances between an ordered sequence of clones. Unlike other programs for physical mapping, ODS is very general in the types of data that can be utilized for chromosome reconstruction. Any trait that can be scored in a presence–absence manner, such as hybridized synthetic oligonucleotides, restriction endonuclease recognition sites or single copy landmarks, can be used for analysis. Furthermore, the computational requirements for the construction of large physical maps can be measured in a matter of hours on workstations such as the VAX2000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 GeneticsHome page
Z. Xu, B. Lance, C. Vargas, B. Arpinar, S. Bhandarkar, E. Kraemer, K. J. Kochut, J. A. Miller, J. R. Wagner, M. J. Weise, et al.
Mapping by Sequencing the Pneumocystis Genome Using the Ordering DNA Sequences V3 Tool
Genetics, April 1, 2003; 163(4): 1299 - 1313.
[Abstract] [Full Text] [PDF]

Home page
 GeneticsHome page
S. M. Bhandarkar, S. A. Machaka, S. S. Shete, and R. N. Kota
Parallel Computation of a Maximum-Likelihood Estimator of a Physical Map
Genetics, March 1, 2001; 157(3): 1021 - 1043.
[Abstract] [Full Text]

Home page
 GeneticsHome page
D. Hall, S. M. Bhandarkar, and J. Wang
ODS2: A Multiplatform Software Application for Creating Integrated Physical and Genetic Maps
Genetics, March 1, 2001; 157(3): 1045 - 1056.
[Abstract] [Full Text]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.