Sciweavers

25 search results - page 4 / 5
» Maximum Likelihood of Evolutionary Trees Is Hard
Sort
View
IPPS
2006
IEEE
15 years 3 months ago
Phylogenetic models of rate heterogeneity: a high performance computing perspective
Inference of phylogenetic trees using the maximum likelihood (ML) method is NP-hard. Furthermore, the computation of the likelihood function for huge trees of more than 1,000 orga...
Alexandros Stamatakis
ALGORITHMICA
2006
163views more  ALGORITHMICA 2006»
14 years 9 months ago
Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines
Phylogenetic analysis is an area of computational biology concerned with the reconstruction of evolutionary relationships between organisms, genes, and gene families. Maximum likel...
Thomas M. Keane, Andrew J. Page, Thomas J. Naughto...
GECCO
2003
Springer
15 years 3 months ago
Optimizing the Order of Taxon Addition in Phylogenetic Tree Construction Using Genetic Algorithm
Phylogenetics has gained in public favor for the analysis of DNA sequence data as molecular biology has advanced. Among a number of algorithms for phylogenetics, the fastDNAml is c...
Yong-Hyuk Kim, Seung-Kyu Lee, Byung Ro Moon
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
15 years 1 months ago
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...
GCB
2000
Springer
137views Biometrics» more  GCB 2000»
15 years 1 months ago
Detecting Sporadic Recombination in DNA Alignments with Hidden Markov Models
Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets fro...
Dirk Husmeier, Frank Wright