×
Loading...

Algorithms in bioinformatics : First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001 proceedings by Gascuel, Olivier, 1956-

Book Information

TitleAlgorithms in bioinformatics : First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001 proceedings
CreatorGascuel, Olivier, 1956-, Moret, B. M. E. (Bernard M. E.), WABI 2001 (2001 : Århus, Denmark)
Year2001
PPI300
PublisherBerlin ; New York : Springer
LanguageEnglish
Mediatypetexts
SubjectBioinformatics, Computer algorithms
ISBN3540425160
Collectionfolkscanomy_miscellaneous, folkscanomy, additional_collections
Uploadersketch
Identifierspringer_10.1007-3-540-44696-6
Telegram icon Share on Telegram
Download Now

Description

Algorithms in Bioinformatics: First International Workshop, WABI 2001 Århus Denmark, August 28–31, 2001 ProceedingsAuthor: Olivier Gascuel, Bernard M. E. Moret Published by Springer Berlin Heidelberg ISBN: 978-3-540-42516-8 DOI: 10.1007/3-540-44696-6Table 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