Computational Molecular Biology: An Algorithmic Approach (computational Molecular Biology) [DJVU]

Preparing link to download Please wait... Attached file not found

E-Book Overview

In one of the first major texts in the emerging field of computational molecular biology, Pavel Pevzner covers a broad range of algorithmic and combinatorial topics and shows how they are connected to molecular biology and to biotechnology. The book has a substantial "computational biology without formulas" component that presents the biological and computational ideas in a relatively simple manner. This makes the material accessible to computer scientists without biological training, as well as to biologists with limited background in computer science. Computational Molecular Biology series Computer science and mathematics are transforming molecular biology from an informational to a computational science. Drawing on computational, statistical, experimental, and technological methods, the new discipline of computational molecular biology is dramatically increasing the discovery of new technologies and tools for molecular biology. The new MIT Press Computational Molecular Biology series provides a unique venue for the rapid publication of monographs, textbooks, edited collections, reference works, and lecture notes of the highest quality.

---

E-Book Information

• Year: 2,000

• Edition: 1

• Pages: 324

• Pages In File: 333

• Language: English

• Issue: 2011 12 30

• Identifier: 0262161974,9780262161978

• Ddc: 573

• Lcc: QH506 .P47 2000

• Dpi: 300

• Org File Size: 3,050,395

• Extension: djvu

• Toc: frontcover......Page 1Contents......Page 7Preface......Page 131.2 Genetic Mapping ......Page 191.3 Physical Mapping ......Page 231.4 Sequencing ......Page 261.5 Similarity Search ......Page 281.6 Gene Prediction ......Page 301.8 Comparative Genomics ......Page 321.9 Proteomics ......Page 352.1 Introduction ......Page 372.2 Double Digest Problem ......Page 392.3 Multiple Solutions of the Double Digest Problem ......Page 412.4 Alternating Cycles in Colored Graphs ......Page 442.5 Transformations of Alternating Eulerian Cycles ......Page 452.6 Physical Maps and Alternating Eulerian Cycles ......Page 502.7 Partial Digest Problem ......Page 522.8 Homometric Sets ......Page 532.9.2 Probed Partial Digest mapping ......Page 563.1 Introduction ......Page 593.2 Mapping with Non-Unique Probes ......Page 623.3 Mapping with Unique Probes ......Page 663.4 Interval Graphs ......Page 683.5 Mapping with Restriction Fragment Fingerprints ......Page 713.6.1 Lander Waterman statistics ......Page 723.6.3 Radiation hybrid mapping ......Page 734.1 Introduction ......Page 774.2 Overlap. Layout. and Consensus ......Page 794.3 Double-Barreled Shotgun Sequencing ......Page 804.4.2 Finishing phase of DNA sequencing ......Page 815.1 Introduction ......Page 835.2 Sequencing by Hybridization ......Page 855.3 SBH and the Shortest Superstring Problem ......Page 865.4 SBH and the Eulerian Path Problem ......Page 885.5 Probability of Unique Sequence Reconstruction ......Page 925.6 String Rearrangements ......Page 935.7 two-optimal Eulerian Cycles ......Page 965.8 Positional