Computational Molecular Biology: An Algorithmic Approach (computational Molecular Biology) [DJVU]
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 1 Contents......Page 7 Preface......Page 13 1.2 Genetic Mapping ......Page 19 1.3 Physical Mapping ......Page 23 1.4 Sequencing ......Page 26 1.5 Similarity Search ......Page 28 1.6 Gene Prediction ......Page 30 1.8 Comparative Genomics ......Page 32 1.9 Proteomics ......Page 35 2.1 Introduction ......Page 37 2.2 Double Digest Problem ......Page 39 2.3 Multiple Solutions of the Double Digest Problem ......Page 41 2.4 Alternating Cycles in Colored Graphs ......Page 44 2.5 Transformations of Alternating Eulerian Cycles ......Page 45 2.6 Physical Maps and Alternating Eulerian Cycles ......Page 50 2.7 Partial Digest Problem ......Page 52 2.8 Homometric Sets ......Page 53 2.9.2 Probed Partial Digest mapping ......Page 56 3.1 Introduction ......Page 59 3.2 Mapping with Non-Unique Probes ......Page 62 3.3 Mapping with Unique Probes ......Page 66 3.4 Interval Graphs ......Page 68 3.5 Mapping with Restriction Fragment Fingerprints ......Page 71 3.6.1 Lander Waterman statistics ......Page 72 3.6.3 Radiation hybrid mapping ......Page 73 4.1 Introduction ......Page 77 4.2 Overlap. Layout. and Consensus ......Page 79 4.3 Double-Barreled Shotgun Sequencing ......Page 80 4.4.2 Finishing phase of DNA sequencing ......Page 81 5.1 Introduction ......Page 83 5.2 Sequencing by Hybridization ......Page 85 5.3 SBH and the Shortest Superstring Problem ......Page 86 5.4 SBH and the Eulerian Path Problem ......Page 88 5.5 Probability of Unique Sequence Reconstruction ......Page 92 5.6 String Rearrangements ......Page 93 5.7 two-optimal Eulerian Cycles ......Page 96 5.8 Positional