Titlebook: Algorithms in Bioinformatics; First International Olivier Gascuel,Bernard M. E. Moret Conference proceedings 2001 Springer-Verlag Berlin H

纯朴

Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar,consider the related problem of finding a run through a hidden Markov model and derivation in a grammar that generate the same sequence and have maximal joint probability by a generalization of the C YK algorithm for parsing a sequence by a stochastic context-free grammar. We illustrate the methods by an experiment on RNA secondary structures.

freight

敌手

Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes, new method, ., for estimating the true evolutionary distance between two signed genomes. Our simulation study shows Exact-IEBP is a better estimation of true evolutionary distances. Furthermore, Exact-IEBP produces more accurate trees than IEBP when used with the popular distance-based method, neighbor joining [.].

gusher

https://doi.org/10.1007/3-540-27609-2ian distributions. Therefore, our work generalizes Yang’s solution. In addition, our derivation of the analytic solution is substantially simpler. We employ the Hadamard conjugation (Hendy and Penny, 1993) and convexity of an entropy-like function.

大看台

斗争

展览

The Performance of Phylogenetic Methods on Trees of Bounded Diameter,We find that the new phylogenetic methods offer an advantage over the neighbor-joining method, except at low rates of evolution where they have comparable performance. The improvement in performance of the new methods over neighbor-joining increases with the number of taxa and the rate of evolution.

Outspoken

An Improved Model for Statistical Alignment,nction approach is introduced to describe the multiple insertion process. The presented algorithm computes the approximate joint probability of two sequences in .(. .) running time where . is the geometric mean of the sequence lengths.

四指套

Matrimony

False Positives in Genomic Map Assembly and Sequence Validation,e positive probability bound, we show that the probability of failure to compute the correct map can be limited to acceptable levels if the input map error rates satisfy certain sharply delineated conditions. Thus careful experimental design must be used to ensure that whole genome map assembly can be done quickly and reliably.