Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Pevzner P.A. — Computational Molecular Biology An Algorithmic Approach
Pevzner P.A. — Computational Molecular Biology An Algorithmic Approach

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Computational Molecular Biology An Algorithmic Approach

Автор: Pevzner P.A.

Аннотация:

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.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2001

Количество страниц: 332

Добавлена в каталог: 10.02.2013

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
2-in-2-out graph      80
2-optimal Eulerian cycle      78
2-path      78
Acceptor site      156
Adaptive SBH      91
adjacency      179
Affine gap penalties      100
Aho - Corasick algorithm      116
Alignment      94 98
Alignment score      94 98
Alternating array      84
Alternating cycle      26 180
Alternative splicing      169
Alu repeat      61
Amino acid      271
Anti-symmetric path      240
Antichain      109
Approximate string matching      114
Arratia - Steele conjecture      107
Atomic interval      46
Autocorrelation polynomial      136
Backtracking      97
Backtracking algorithm for PDP      20
Backward algorithm      146
Bacterial Artificial Chromosome      44
Balanced collection of stars      127
Balanced graph      27 180
Balanced partitioning      260
Balanced vertex      27 70
Baum - Welch algorithm      147
Best bet for simpletons      136
BEST theorem      72
Binary array      83
Binary Flip - Cut Problem      38
Bipartite interval graph      251
Bitableau      102
BLAST      115
BLOSUM matrix      98
Border length of mask      88
bounded array      258
Branching probability      85
Breakpoint      179
Breakpoint graph      179
Candidate gene library      167
Capping of chromosomes      186
Cassette exchange      23
Cassette reflection      23
Cassette transformations      21
Catalan number      75 261
Catalan sequence      261
cDNA      272
CG-island      144
Chain      109
Chimeric alignment problem      261
Chimeric clone      44
Chromosome      185 271
Chromosome painting      187
Chromosome walking      5
Circular-arc graph      254 1
CLIQUE      51
Clone abnormalities      43
Clone library      5
Cloning      5 273
Cloning vector      41 273
Co-tailed genomes      214
Codon      271
Codon usage      155
Common forests      109
Common inverted forests      110
Common inverted subsequences      110
Communication cost      126
Comparability graph      50
Comparative genetic map      15
Compatible alignments      126
Complete graph      51
Conflict-free interval set      46
Conjugate partial orders      109
Consecutive ones property      43
Consensus (in fragment assembly)      61
Consensus String Problem      143
Consensus word analysis      143
Consistent edge      131
Consistent graph      131
Consistent set of intervals      46
Contig      62
Continuous stacking hybridization      75
Correlation polynomial      137
Cosmid      44
Cosmid contig mapping      255
Cover      110
Cover graph      204
Coverage      54
Critical path      251
Crossing edges in embedding      268
Cycle decomposition      180
Cystic fibrosis      1
DDP      20
Decision tree      169
Decoding Problem      146 265
Decreasing subsequence      102
Deletion      98
Diagram adjustment      253
Dilworth theorem      110
Distance from Consensus      125
Divide-and-conquer      101
DNA      271
DNA array      9 65
DNA read      61
Donor site      156
Dot-matrix      124
Double Digest Problem      20
Double filtration      157
Double-barreled sequencing      62
Double-stranded DNA      271
Duality      113
Dynamic programming      96
Edit distance      11 93
Edit graph      98
Embedding      268
Emission probability      145
Equivalent transformations      196
Eukaryotes      271
Euler set of 2-paths      78
Euler switch      78
Eulerian cycle      26 70
Eulerian graph      70
Exon      12 153 272
ExonPCR      168
Extendable sequence      85
FASTA      115
Fidelity probes      92
Filtering in database search      94
Filtration efficiency      116
Filtration in string matching      114
Filtration of candidate exons      165
Fingerprint of clone      42
Finishing phase of sequencing      63
Fission      185
Fitting alignment      259
Flip vector      215
Flipping of chromosomes      186
Fork      32
Fork graph      32
Fortress      209
Fortress-of-knots      216
FORWARD ALGORITHM      146
Fragment assembly problem      61
Frequent String Problem      144
Fusion      185
Gap      100
Gap penalty      100
Gapped $l$-tuple      117
Gapped array      83
Gapped signals      150
Gel-electrophoresis      273
Gene      271
Generalized permutation      197
Generalized sequence alignment      109
Generating function      36
genetic code      271
Genetic mapping      2
Genetic markers      3
GenMaik      173
Genome      271
Genome comparison      176
Genome duplication      226
Genome rearrangement      15 175
Genomic distance      186
Genomic sorting      215
GenScan      172
Gibbs sampling      149
Global alignment      94
Gollan permutation      188
Graph Consistency Problem      131
Gray code      88
Group Testing Problem      55
Hamiltonian cycle      69
Hamiltonian path      66
Hamming Distance TSP      44
Hexamer count      155
Hidden Markov model      145
Hidden state      145
HMM      145
Homometric sets      20 35
Human genome project      60
Hurdle      182 193 195
Hybrid screening matrix      56
hybridization      67 273
Hybridization fingerprint      6
Image reconstruction      130
Increasing subsequence      102
Indel      98
Inexact repeat problem      261
Inner Product Mapping      255
insertion      98
Interchromosomal edge      215
Interleaving      45
Interleaving cycles      193
Interleaving edges      193
Interleaving graph      193
Internal reversal      214
Internal translocation      214
Interval graph      43
Intrachromosomal edge      215
Intron      154 272
Ion-type      231
Junk DNA      153
k-similarity      243
KNA folding      121 263
Knot      216
l-star      128
l-tuple composition      66
l-tuple filtration      115
Lander - Waterman statistics      54
Layout of DNA fragments      61
Light-directed array synthesis      88
LINE repeat      62
Local alignment      94 99
Longest common subsequence      11 94
Longest increasing subsequence      102
Longest path problem      98 233
Magic word problem      134
Mapping with non-unique probes      42
Mapping with unique probes      42
Mask for array synthesis      88
Mass-spectrometry      18
Match      98
Mates      62
Matrix dot product      127
Maximal segment pair      116
Memory of DNA array      83
Minimal entropy score      125
Minimum cover      110
Mismatch      98
Mosaic effect      164
mRNA      272
MS/MS      231
Multifork      32
Multiple Digest Problem      253
Multiple Genomic Distance Problem      227
Multiprobe      82
Multiprobe array      85
Nested strand hybridization      259
Network alignment      162
Normalized local alignment      260
Nucleotide      271
Offset frequency function      236
Open reading frame (ORF)      155
Optical mapping      38 254
Optimal concatenate      215
Order exchange      28
Order reflection      28
Oriented component      193
Oriented cycle (breakpoint graph)      193
Oriented edge (breakpoint graph)      193
Overlapping words paradox      136
padding      197
PAM matrix      98
Pancake flipping problem      179
Parameter estimation for HMM      147
Parametric alignment      118 262
Partial Digest Problem      8
Partial peptide      18
Partial tableau      104
Partially ordered set      109
Partition of integer      102
Path cover      53
Path in HMM      145
Pattern-driven approach      135
PCR      272
PCR primer      273
PDP.      312
Peptide      273
Peptide Identification Problem      240
Peptide Sequence Tag      230
Peptide Sequencing Problem      18 231
Phase transition curve      119 263
Phenotype      2
Physical map      5
placement      45
Polyhedral approach      113
pooling      55
Positional cloning      167
Positional Eulerian Path Problem      82
Positional SBH      81
Post-translational modifications      230
PQ-tree      43
Prefix reversal diameter      179
Probe      4 273
Probe interval graph      255
Probed Partial Digest Mapping      38
Profile      148
Profile HMM alignment      148
Prokaryotes      271
Promoter      272
Proper graph      240
Proper reversal      192
Protease      273
Protein      271
Protein sequencing      18 59
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2019
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте