Sciweavers

Share
6 search results - page 1 / 2
» Parsimony accelerated Maximum Likelihood searches
Sort
View
IJCBDD
2008
113views more  IJCBDD 2008»
10 years 1 months ago
Parsimony accelerated Maximum Likelihood searches
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...
BIBE
2007
IEEE
108views Bioinformatics» more  BIBE 2007»
10 years 7 months ago
Using Parsimony to Guide Maximum Likelihood Searches
—The performance of maximum likelihood searches can be boosted by using the most parsimonious tree as a starting point for the search. The time spent in performing the parsimony ...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...
BMCBI
2008
139views more  BMCBI 2008»
10 years 1 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu
GPEM
2000
121views more  GPEM 2000»
10 years 1 months ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
10 years 2 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...
books