Algorithms in bioinformatics

the long version

Algorithms in Bioinformatics: First International Workshop, WABI 2001 Århus Denmark, August 28–31, 2001 Proceedings<br />Author: Olivier Gascuel, Bernard M. E. Moret<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42516-8<br /> DOI: 10.1007/3-540-44696-6<br /><br />Table of Contents:<p></p><ul><li>An Improved Model for Statistical Alignment </li><li>Improving Profile-Profile Alignments via Log Average Scoring </li><li>False Positives in Genomic Map Assembly and Sequence Validation </li><li>Boosting EM for Radiation Hybrid and Genetic Mapping </li><li>Placing Probes along the Genome Using Pairwise Distance Data </li><li>Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar </li><li>Assessing the Statistical Significance of Overrepresented Oligonucleotides </li><li>Pattern Matching and Pattern Discovery Algorithms for Protein Topologies </li><li>Computing Linking Numbers of a Filtration </li><li>Side Chain-Positioning as an Integer Programming Problem </li><li>A Chemical-Distance-Based Test for Positive Darwinian Selection </li><li>Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time </li><li>Experiments in Computing Sequences of Reversals </li><li>Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes </li><li>Finding an Optimal Inversion Median: Experimental Results </li><li>Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites </li><li>The Performance of Phylogenetic Methods on Trees of Bounded Diameter </li><li>(1+ε)-Approximation of Sorting by Reversals and Transpositions </li><li>On the Practical Solution of the Reversal Median Problem </li><li>Algorithms for Finding Gene Clusters</li></ul>