890 search results - page 4 / 178 » New Approaches to Compare Phylogenetic Search Heuristics |
FLAIRS
2008
14 years 12 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--A hybrid MPI/Pthreads parallelization was implemented in the RAxML phylogenetics code. New MPI code was added to the existing Pthreads production code to exploit parallel...
100
click to vote
JAMDS
2002
14 years 9 months ago
2002
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short comp...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
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...
BMEI
2008
IEEE
15 years 4 months ago
2008
IEEE
Multiple sequence alignment is the most fundamental task in bioinformatics and computational biology. In this paper, we present a new algorithm to conduct multiple sequences align...