Sciweavers

129 search results - page 11 / 26
» An Investigation of Phylogenetic Likelihood Methods
Sort
View
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
BMCBI
2006
143views more  BMCBI 2006»
13 years 7 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
ICPADS
2005
IEEE
14 years 1 months ago
PRec-I-DCM3: A Parallel Framework for Fast and Accurate Large Scale Phylogeny Reconstruction
: Accurate reconstruction of phylogenetic trees very often involves solving hard optimization problems, particularly the maximum parsimony (MP) and maximum likelihood (ML) problems...
Cristian Coarfa, Yuri Dotsenko, John M. Mellor-Cru...
BMCBI
2010
117views more  BMCBI 2010»
13 years 7 months ago
Using jackknife to assess the quality of gene order phylogenies
Background: In recent years, gene order data has attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. If ge...
Jian Shi, Yiwei Zhang, Haiwei Luo, Jijun Tang
ICASSP
2008
IEEE
14 years 2 months ago
Adaptive score normalization for progressive model adaptation in text independent speaker verification
This paper deals with the interaction between progressive model adaptation and score normalization strategies which are used for reducing the variation in likelihood ratio scores ...
Shou-Chun Yin, Richard Rose, Patrick Kenny