Algorithms in Bioinformatics Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003, Proceedings - neues Buch

EAN (ISBN-13): 9783540200765
ISBN (ISBN-10): 3540200762
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2003
Herausgeber: Springer Berlin Heidelberg
528 Seiten
Gewicht: 0,812 kg

Buch in der Datenbank seit 2007-06-04T13:24:03+02:00 (Vienna)
Detailseite zuletzt geändert am 2023-12-17T18:37:41+01:00 (Vienna)
ISBN/EAN: 9783540200765

ISBN - alternative Schreibweisen:
3-540-20076-2, 978-3-540-20076-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: berg, wendt, benson, jan call
Titel des Buches: proceedings international workshop, algorithms bioinformatics, hungary, wabi, antiquariats buchhandel, september, greetings from old budapest, third, computer science

---

Daten vom Verlag:

Autor/in: Gary Benson; Roderic Page
Titel: Lecture Notes in Computer Science; Lecture Notes in Bioinformatics; Algorithms in Bioinformatics - Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003, Proceedings
Verlag: Springer; Springer Berlin
534 Seiten
Erscheinungsjahr: 2003-09-09
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
X, 534 p.

BC; Hardcover, Softcover / Biologie; Biowissenschaften, allgemein; Verstehen; Alignment; algorithmics; algorithms; bioinformatics; computational biology; data analysis; data mining; database; discrete mathematics; genetics; genome; genomics; molecular biology; pattern searching; searching; algorithm analysis and problem complexity; data structures; Life Sciences; Programming Techniques; Algorithms; Data Science; Theory of Computation; Mathematics of Computing; Computerprogrammierung und Softwareentwicklung; Algorithmen und Datenstrukturen; Datenbanken; Theoretische Informatik; Mathematik für Informatiker; EA

Comparative Genomics.- A Local Chaining Algorithm and Its Applications in Comparative Genomics.- Common Intervals of Two Sequences.- A Systematic Statistical Analysis of Ion Trap Tandem Mass Spectra in View of Peptide Scoring.- Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specificity.- Gene Finding and Expression.- A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods.- A Method to Detect Gene Structure and Alternative Splice Sites by Agreeing ESTs to a Genomic Sequence.- Optimal DNA Signal Recognition Models with a Fixed Amount of Intrasignal Dependency.- Genome Mapping.- New Algorithm for the Simplified Partial Digest Problem.- Noisy Data Make the Partial Digest Problem NP-hard.- Pattern and Motif Discovery.- Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions.- A Combinatorial Approach to Automatic Discovery of Cluster-Patterns.- Dynamic Programming Algorithms for Two Statistical Problems in Computational Biology.- Phylogenetic Analysis.- Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees.- Efficient Generation of Uniform Samples from Phylogenetic Trees.- New Efficient Algorithm for Detection of Horizontal Gene Transfer Events.- Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.- A Linear-Time Majority Tree Algorithm.- Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model.- Better Hill-Climbing Searches for Parsimony.- Computing Refined Buneman Trees in Cubic Time.- Distance Corrections on Recombinant Sequences.- Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks.- Polymorphism.- Identifying Blocks and Sub-populations in Noisy SNP Data.- Designing Optimally Multiplexed SNP Genotyping Assays.- Minimum Recombinant Haplotype Configuration on Tree Pedigrees.- Protein Structure.- Efficient Energy Computation for Monte Carlo Simulation of Proteins.- Speedup LP Approach to Protein Threading via Graph Reduction.- Homology Modeling of Proteins Using Multiple Models and Consensus Sequence Alignment.- Side-Chain Structure Prediction Based on Dead-End Elimination: Single Split DEE-criterion Implementation and Elimination Power.- Sequence Alignment.- A Large Version of the Small Parsimony Problem.- Optimal Multiple Parsimony Alignment with Affine Gap Cost Using a Phylogenetic Tree.- Composition Alignment.- String Algorithms.- Match Chaining Algorithms for cDNA Mapping.- Sequencing from Compomers: Using Mass Spectrometry for DNA De-Novo Sequencing of 200+ nt.- Bounds for Resequencing by Hybridization.- Selecting Degenerate Multiplex PCR Primers.
Includes supplementary material: sn.pub/extras