Sciweavers

1099 search results - page 25 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
JCB
2006
107views more  JCB 2006»
14 years 9 months ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir
PRDC
2008
IEEE
15 years 4 months ago
On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
Julien Clement, Thomas Hérault, Stép...
BIB
2008
88views more  BIB 2008»
14 years 10 months ago
MEGA: A biologist-centric software for evolutionary analysis of DNA and protein sequences
The Molecular Evolutionary Genetics Analysis (MEGA) software is a desktop application designed for comparative analysis of homologous gene sequences either from multigene families...
Sudhir Kumar, Masatoshi Nei, Joel Dudley, Koichiro...
ICAART
2010
INSTICC
15 years 6 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
BIOCOMP
2006
14 years 11 months ago
PAC: Progressive Alignment with Consensus Sequences
Computation of multiple sequence alignments is one of the major open problems in computational molecular biology. The purpose of this study was to provide a new method, PAC (Progre...
Ke Liu, Mansur H. Samadzadeh