A rapid bootstrap algorithm for the RAxML web servers

A Stamatakis, P Hoover, J Rougemont - Systematic biology, 2008 - academic.oup.com
Despite recent advances achieved by application of high-performance computing methods
and novel algorithmic techniques to maximum likelihood (ML)-based inference programs …

Phylogenetic models of rate heterogeneity: a high performance computing perspective

A Stamatakis - Proceedings 20th IEEE international parallel & …, 2006 - ieeexplore.ieee.org
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 …

[ΒΙΒΛΙΟ][B] Parallel computing for bioinformatics and computational biology

AY Zomaya - 2005 - Wiley Online Library
Bioinformatics and Computational Biology are fields that requires skills from a variety of
fields to enable the gathering, storing, handling, analyzing, interpreting, and spreading of …

Increasing the efficiency of searches for the maximum likelihood tree in a phylogenetic analysis of up to 150 nucleotide sequences

DA Morrison - Systematic Biology, 2007 - academic.oup.com
Even when the maximum likelihood (ML) tree is a better estimate of the true phylogenetic
tree than those produced by other methods, the result of a poor ML search may be no better …

Algorithms, data structures, and numerics for likelihood-based phylogenetic inference of huge trees

F Izquierdo-Carrasco, SA Smith, A Stamatakis - BMC bioinformatics, 2011 - Springer
Background The rapid accumulation of molecular sequence data, driven by novel wet-lab
sequencing technologies, poses new challenges for large-scale maximum likelihood-based …

[PDF][PDF] A theoretical analysis of multi-agent patrolling strategies

Y Chevaleyre, F Sempe, G Ramalho - AAMAS, 2004 - researchgate.net
A group of agents can be used to perform patrolling tasks in a variety of domains ranging
from computer network administration to computer wargame simulations. The quality of the …

An efficient program for phylogenetic inference using simulated annealing

A Stamatakis - 19th IEEE International Parallel and Distributed …, 2005 - ieeexplore.ieee.org
Inference of phylogenetic trees comprising thousands of organisms based on the maximum
likelihood method is computationally expensive. A new program RAxML-SA (Randomized …

Shortest triplet clustering: reconstructing large phylogenies using representative sets

L Sy Vinh, A von Haeseler - BMC bioinformatics, 2005 - Springer
Background Understanding the evolutionary relationships among species based on their
genetic information is one of the primary objectives in phylogenetic analysis. Reconstructing …

Phylogenetic search algorithms for maximum likelihood

A Stamatakis - Algorithms in Computational Molecular Biology …, 2011 - Wiley Online Library
The reconstruction of phylogenetic (evolutionary) trees from molecular sequence data is a
comparatively old problem in bioinformatics, given that Joe Felsenstein's seminal paper [12] …

Parallel divide-and-conquer phylogeny reconstruction by maximum likelihood

Z Du, A Stamatakis, F Lin, U Roshan… - … Conference on High …, 2005 - Springer
Phylogenetic trees are important in biology since their applications range from determining
protein function to understanding the evolution of species. Maximum Likelihood (ML) is a …