SIESTA: enhancing searches for optimal supertrees and species trees
Abstract Background Many supertree estimation and multi-locus species tree estimation methods compute trees by combining trees on subsets of the species set based on some NP-hard optimization criterion. A recent approach to computing large trees has been to constrain the search space by defining a s...
Main Authors: | Pranjal Vachaspati, Tandy Warnow |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2018-05-01
|
Series: | BMC Genomics |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s12864-018-4621-1 |
Similar Items
-
MRL and SuperFine+MRL: new supertree methods
by: Nguyen Nam, et al.
Published: (2012-01-01) -
Quartets enable statistically consistent estimation of cell lineage trees under an unbiased error and missingness model
by: Yunheng Han, et al.
Published: (2023-12-01) -
Using Robinson-Foulds supertrees in divide-and-conquer phylogeny estimation
by: Xilin Yu, et al.
Published: (2021-06-01) -
Weighted ASTRID: fast and accurate species trees from weighted internode distances
by: Baqiao Liu, et al.
Published: (2023-07-01) -
A supertree pipeline for summarizing phylogenetic and taxonomic information for millions of species
by: Benjamin D. Redelings, et al.
Published: (2017-03-01)