Performance of flip supertree construction with a heuristic algorithm

Oliver Eulenstein, Duhong Chen, J. Gordon Burleih, David Fernández-Baca, Michael Sanderson

Research output: Contribution to journalArticle

49 Citations (Scopus)

Abstract

Supertree methods are used to assemble separate phylogenetic trees with shared taxa into larger trees (supertrees) in an effort to construct more comprehensive phylogenetic hypotheses. In spite of much recent interest in supertrees, there are still few methods for supertree construction. The flip supertree problem is an error correction approach that seeks to find a minimum number of changes (flips) to the matrix representation of the set of input trees to resolve their incompatibilities. A previous flip supertree algorithm was limited to finding exact solutions and was only feasible for small input trees. We developed a heuristic algorithm for the flip supertree problem suitable for much larger input trees. We used a series of 48- and 96-taxon simulations to compare supertrees constructed with the flip supertree heuristic algorithm with supertrees constructed using other approaches, including MinCut (MC), modified MC (MMC), and matrix representation with parsimony (MRP). Flip supertrees are generally far more accurate than supertrees constructed using MC or MMC algorithms and are at least as accurate as supertrees built with MRP. The flip supertree method is therefore a viable alternative to other supertree methods when the number of taxa is large.

Original languageEnglish (US)
Pages (from-to)299-308
Number of pages10
JournalSystematic Biology
Volume53
Issue number2
DOIs
StatePublished - Apr 2004
Externally publishedYes

Fingerprint

heuristics
matrix
phylogenetics
error correction
incompatibility
phylogeny
methodology
method
Heuristics
simulation

Keywords

  • Flipping
  • Phylogeny
  • Simulation study
  • Supertree

ASJC Scopus subject areas

  • Ecology, Evolution, Behavior and Systematics

Cite this

Performance of flip supertree construction with a heuristic algorithm. / Eulenstein, Oliver; Chen, Duhong; Burleih, J. Gordon; Fernández-Baca, David; Sanderson, Michael.

In: Systematic Biology, Vol. 53, No. 2, 04.2004, p. 299-308.

Research output: Contribution to journalArticle

Eulenstein, O, Chen, D, Burleih, JG, Fernández-Baca, D & Sanderson, M 2004, 'Performance of flip supertree construction with a heuristic algorithm', Systematic Biology, vol. 53, no. 2, pp. 299-308. https://doi.org/10.1080/10635150490423719
Eulenstein, Oliver ; Chen, Duhong ; Burleih, J. Gordon ; Fernández-Baca, David ; Sanderson, Michael. / Performance of flip supertree construction with a heuristic algorithm. In: Systematic Biology. 2004 ; Vol. 53, No. 2. pp. 299-308.
@article{1245d4ac8b17474894e959bec65fbcbb,
title = "Performance of flip supertree construction with a heuristic algorithm",
abstract = "Supertree methods are used to assemble separate phylogenetic trees with shared taxa into larger trees (supertrees) in an effort to construct more comprehensive phylogenetic hypotheses. In spite of much recent interest in supertrees, there are still few methods for supertree construction. The flip supertree problem is an error correction approach that seeks to find a minimum number of changes (flips) to the matrix representation of the set of input trees to resolve their incompatibilities. A previous flip supertree algorithm was limited to finding exact solutions and was only feasible for small input trees. We developed a heuristic algorithm for the flip supertree problem suitable for much larger input trees. We used a series of 48- and 96-taxon simulations to compare supertrees constructed with the flip supertree heuristic algorithm with supertrees constructed using other approaches, including MinCut (MC), modified MC (MMC), and matrix representation with parsimony (MRP). Flip supertrees are generally far more accurate than supertrees constructed using MC or MMC algorithms and are at least as accurate as supertrees built with MRP. The flip supertree method is therefore a viable alternative to other supertree methods when the number of taxa is large.",
keywords = "Flipping, Phylogeny, Simulation study, Supertree",
author = "Oliver Eulenstein and Duhong Chen and Burleih, {J. Gordon} and David Fern{\'a}ndez-Baca and Michael Sanderson",
year = "2004",
month = "4",
doi = "10.1080/10635150490423719",
language = "English (US)",
volume = "53",
pages = "299--308",
journal = "Systematic Biology",
issn = "1063-5157",
publisher = "Oxford University Press",
number = "2",

}

TY - JOUR

T1 - Performance of flip supertree construction with a heuristic algorithm

AU - Eulenstein, Oliver

AU - Chen, Duhong

AU - Burleih, J. Gordon

AU - Fernández-Baca, David

AU - Sanderson, Michael

PY - 2004/4

Y1 - 2004/4

N2 - Supertree methods are used to assemble separate phylogenetic trees with shared taxa into larger trees (supertrees) in an effort to construct more comprehensive phylogenetic hypotheses. In spite of much recent interest in supertrees, there are still few methods for supertree construction. The flip supertree problem is an error correction approach that seeks to find a minimum number of changes (flips) to the matrix representation of the set of input trees to resolve their incompatibilities. A previous flip supertree algorithm was limited to finding exact solutions and was only feasible for small input trees. We developed a heuristic algorithm for the flip supertree problem suitable for much larger input trees. We used a series of 48- and 96-taxon simulations to compare supertrees constructed with the flip supertree heuristic algorithm with supertrees constructed using other approaches, including MinCut (MC), modified MC (MMC), and matrix representation with parsimony (MRP). Flip supertrees are generally far more accurate than supertrees constructed using MC or MMC algorithms and are at least as accurate as supertrees built with MRP. The flip supertree method is therefore a viable alternative to other supertree methods when the number of taxa is large.

AB - Supertree methods are used to assemble separate phylogenetic trees with shared taxa into larger trees (supertrees) in an effort to construct more comprehensive phylogenetic hypotheses. In spite of much recent interest in supertrees, there are still few methods for supertree construction. The flip supertree problem is an error correction approach that seeks to find a minimum number of changes (flips) to the matrix representation of the set of input trees to resolve their incompatibilities. A previous flip supertree algorithm was limited to finding exact solutions and was only feasible for small input trees. We developed a heuristic algorithm for the flip supertree problem suitable for much larger input trees. We used a series of 48- and 96-taxon simulations to compare supertrees constructed with the flip supertree heuristic algorithm with supertrees constructed using other approaches, including MinCut (MC), modified MC (MMC), and matrix representation with parsimony (MRP). Flip supertrees are generally far more accurate than supertrees constructed using MC or MMC algorithms and are at least as accurate as supertrees built with MRP. The flip supertree method is therefore a viable alternative to other supertree methods when the number of taxa is large.

KW - Flipping

KW - Phylogeny

KW - Simulation study

KW - Supertree

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

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

U2 - 10.1080/10635150490423719

DO - 10.1080/10635150490423719

M3 - Article

C2 - 15205054

AN - SCOPUS:2442598026

VL - 53

SP - 299

EP - 308

JO - Systematic Biology

JF - Systematic Biology

SN - 1063-5157

IS - 2

ER -