Document - eBookmela
Loading...

Algorithms in bioinformatics : First International Workshop, WABI 2001, Aarhus, Denmark, August 28 31, 2001 pr | Gascuel, Olivier, 1956-, Moret, B. M. E. (Bernard M. E.), WABI 2001 (2001 : Århus, Denmark)

Likes0
Telegram icon Share on Telegram
Just a moment...
" id="short-url-input" readonly>

Algorithms in bioinformatics : First International Workshop, WABI 2001, Aarhus, Denmark, August 28 31, 2001 pr

User Rating: Be the first one!

Author: Gascuel, Olivier, 1956-, Moret, B. M. E. (Bernard M. E.), WABI 2001 (2001 : Århus, Denmark)

Added by: sketch

Added Date: 2015-12-30

Publication Date: 2001

Language: eng

Subjects: Bioinformatics, Computer algorithms

Publishers: Berlin ; New York : Springer

Collections: folkscanomy miscellaneous, folkscanomy, additional collections

ISBN Number: 3540425160

Pages Count: 300

PPI Count: 300

PDF Count: 1

Total Size: 152.78 MB

PDF Size: 6.97 MB

Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc

Edition: [Elektronische Ressource]

Archive Url

Downloads: 894

Views: 944

Total Files: 18

Media Type: texts

Description

Algorithms in Bioinformatics: First International Workshop, WABI 2001 Århus Denmark, August 28–31, 2001 Proceedings
Author: Olivier Gascuel, Bernard M. E. Moret
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42516-8
DOI: 10.1007/3-540-44696-6

Table of Contents:

  • 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

Includes bibliographical references and index
eBookmela
Logo
Register New Account