Stochastic search strategy for estimation of maximum likelihood phylogenetic trees

Laura A. Salter, Dennis Keith Pearl

Research output: Contribution to journalArticle

56 Citations (Scopus)

Abstract

The maximum likelihood (ML) method of phylogenetic tree construction is not as widely used as other tree construction methods (e.g., parsimony, neighbor-joining) because of the prohibitive amount of time required to find the ML tree when the number of sequences under consideration is large. To overcome this difficulty, we propose a stochastic search strategy for estimation of the ML tree that is based on a simulated annealing algorithm. The algorithm works by moving through tree space by way of a "local rearrangement" strategy so that topologies that improve the likelihood are always accepted, whereas those that decrease the likelihood are accepted with a probability that is related to the proportionate decrease in likelihood. Besides greatly reducing the time required to estimate the ML tree, the stochastic search strategy is less likely to become trapped in local optima than are existing algorithms for ML tree estimation. We demonstrate the success of the modified simulated annealing algorithm by comparing it with two existing algorithms (Swofford's PAUP* and Felsenstein's DNAMLK) for several theoretical and real data examples.

Original languageEnglish (US)
Pages (from-to)7-17
Number of pages11
JournalSystematic Biology
Volume50
Issue number1
StatePublished - Feb 1 2001

Fingerprint

phylogenetics
phylogeny
annealing
simulated annealing
Likelihood Functions
construction method
topology
methodology

All Science Journal Classification (ASJC) codes

  • Ecology, Evolution, Behavior and Systematics
  • Genetics

Cite this

@article{1b82429b585c4df2a2fce6ec91b8e5c1,
title = "Stochastic search strategy for estimation of maximum likelihood phylogenetic trees",
abstract = "The maximum likelihood (ML) method of phylogenetic tree construction is not as widely used as other tree construction methods (e.g., parsimony, neighbor-joining) because of the prohibitive amount of time required to find the ML tree when the number of sequences under consideration is large. To overcome this difficulty, we propose a stochastic search strategy for estimation of the ML tree that is based on a simulated annealing algorithm. The algorithm works by moving through tree space by way of a {"}local rearrangement{"} strategy so that topologies that improve the likelihood are always accepted, whereas those that decrease the likelihood are accepted with a probability that is related to the proportionate decrease in likelihood. Besides greatly reducing the time required to estimate the ML tree, the stochastic search strategy is less likely to become trapped in local optima than are existing algorithms for ML tree estimation. We demonstrate the success of the modified simulated annealing algorithm by comparing it with two existing algorithms (Swofford's PAUP* and Felsenstein's DNAMLK) for several theoretical and real data examples.",
author = "Salter, {Laura A.} and Pearl, {Dennis Keith}",
year = "2001",
month = "2",
day = "1",
language = "English (US)",
volume = "50",
pages = "7--17",
journal = "Systematic Biology",
issn = "1063-5157",
publisher = "Oxford University Press",
number = "1",

}

Stochastic search strategy for estimation of maximum likelihood phylogenetic trees. / Salter, Laura A.; Pearl, Dennis Keith.

In: Systematic Biology, Vol. 50, No. 1, 01.02.2001, p. 7-17.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Stochastic search strategy for estimation of maximum likelihood phylogenetic trees

AU - Salter, Laura A.

AU - Pearl, Dennis Keith

PY - 2001/2/1

Y1 - 2001/2/1

N2 - The maximum likelihood (ML) method of phylogenetic tree construction is not as widely used as other tree construction methods (e.g., parsimony, neighbor-joining) because of the prohibitive amount of time required to find the ML tree when the number of sequences under consideration is large. To overcome this difficulty, we propose a stochastic search strategy for estimation of the ML tree that is based on a simulated annealing algorithm. The algorithm works by moving through tree space by way of a "local rearrangement" strategy so that topologies that improve the likelihood are always accepted, whereas those that decrease the likelihood are accepted with a probability that is related to the proportionate decrease in likelihood. Besides greatly reducing the time required to estimate the ML tree, the stochastic search strategy is less likely to become trapped in local optima than are existing algorithms for ML tree estimation. We demonstrate the success of the modified simulated annealing algorithm by comparing it with two existing algorithms (Swofford's PAUP* and Felsenstein's DNAMLK) for several theoretical and real data examples.

AB - The maximum likelihood (ML) method of phylogenetic tree construction is not as widely used as other tree construction methods (e.g., parsimony, neighbor-joining) because of the prohibitive amount of time required to find the ML tree when the number of sequences under consideration is large. To overcome this difficulty, we propose a stochastic search strategy for estimation of the ML tree that is based on a simulated annealing algorithm. The algorithm works by moving through tree space by way of a "local rearrangement" strategy so that topologies that improve the likelihood are always accepted, whereas those that decrease the likelihood are accepted with a probability that is related to the proportionate decrease in likelihood. Besides greatly reducing the time required to estimate the ML tree, the stochastic search strategy is less likely to become trapped in local optima than are existing algorithms for ML tree estimation. We demonstrate the success of the modified simulated annealing algorithm by comparing it with two existing algorithms (Swofford's PAUP* and Felsenstein's DNAMLK) for several theoretical and real data examples.

UR - http://www.scopus.com/inward/record.url?scp=0035527377&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035527377&partnerID=8YFLogxK

M3 - Article

C2 - 12116596

AN - SCOPUS:0035527377

VL - 50

SP - 7

EP - 17

JO - Systematic Biology

JF - Systematic Biology

SN - 1063-5157

IS - 1

ER -