Algorithms in bioinformatics : First International Workshop, WABI 2001, Århus Denmark, August 28 31, 2001 : proceedings
محفوظ في:
| مؤلف مشترك: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | Livre numérique |
| اللغة: | Anglais |
| منشور في: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| سلاسل: | Lecture notes in computer science
2149 |
| الموضوعات: | |
| الوصول للمادة أونلاين: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| ملاحظة: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithms in bioinformatics, First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001 proceedings, Olivier Gascuel, Bernard M.E. Moret (editors.), 2001, Berlin, Springer, 1 vol. (X-306 p.), Lecture notes in computer science, 3-540-42516-0 • Algorithms in Bioinformatics, Texte imprimé, 9783662200223 |
جدول المحتويات:
- An Improved Model for Statistical Alignment
- Improving Profile-Profile Alignments via Log Average Scoring
- False Positives in Genomic Map Assembly and Sequence Validation
- Boosting EM for Radiation Hybrid and Genetic Mapping
- Placing Probes along the Genome Using Pairwise Distance Data
- Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar
- Assessing the Statistical Significance of Overrepresented Oligonucleotides
- Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
- Computing Linking Numbers of a Filtration
- Side Chain-Positioning as an Integer Programming Problem
- A Chemical-Distance-Based Test for Positive Darwinian Selection
- Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time
- Experiments in Computing Sequences of Reversals
- Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes
- Finding an Optimal Inversion Median: Experimental Results
- Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites
- The Performance of Phylogenetic Methods on Trees of Bounded Diameter
- (1+?)-Approximation of Sorting by Reversals and Transpositions
- On the Practical Solution of the Reversal Median Problem
- Algorithms for Finding Gene Clusters
- Determination of Binding Amino Acids Based on Random Peptide Array Screening Data
- A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites
- Comparing Assemblies Using Fragments and Mate-Pairs.