Related Experiment Videos
Some mathematical aspects of mapping DNA cosmids
1Laboratory of Mathematical Biology, National Cancer Institute, Bethesda, MD 20892.
Cell Biophysics
|January 1, 1988
Summary
Creating high-resolution physical maps of mammalian chromosomes requires solving experimental and mathematical problems. This study presents a polynomial time algorithm for unique fragment ordering and analyzes signature assignment strategies for reliable map construction.
Area of Science:
- Genomics
- Computational Biology
- Molecular Biology
Background:
- High-resolution physical maps of mammalian chromosomes are essential for genetic research.
- Current methods face challenges in reliably ordering DNA fragments.
Purpose of the Study:
- To develop a computationally efficient algorithm for unique ordering of DNA fragments.
- To analyze signature assignment strategies for physical map construction.
Main Methods:
- Developed a polynomial time algorithm for fragment ordering.
- Analyzed restriction digest fragment length distributions.
- Examined Hans Lehrach's probe-binding signature assignment method.
Main Results:
- The proposed algorithm provides a unique map ordering.
- Analysis of fragment lengths informs algorithm performance and expected map gaps.
- Lehrach's strategy is effective with >= 150 probes, requiring <= 25 probes per fragment.
Conclusions:
- A reliable method for constructing high-resolution physical maps of mammalian chromosomes is presented.
- The polynomial time algorithm ensures unique fragment ordering.
- The probe-binding strategy is validated for efficient and accurate physical mapping.