BCD Beam Search: considering suboptimal partial solutions in Bad Clade Deletion supertrees
Supertree methods enable the reconstruction of large phylogenies. The supertree problem can be formalized in different ways in order to cope with contradictory information in the input. Some supertree methods are based on encoding the input trees in a matrix; other methods try to find minimum cuts i...
Main Authors: | Markus Fleischauer, Sebastian Böcker |
---|---|
Format: | Article |
Language: | English |
Published: |
PeerJ Inc.
2018-06-01
|
Series: | PeerJ |
Subjects: | |
Online Access: | https://peerj.com/articles/4987.pdf |
Similar Items
-
Collecting reliable clades using the Greedy Strict Consensus Merger
by: Markus Fleischauer, et al.
Published: (2016-06-01) -
Updating the evolutionary history of Carnivora (Mammalia): a new species-level supertree complete with divergence time estimates
by: Nyakatura Katrin, et al.
Published: (2012-02-01) -
Molecular phylogeny and classification of the family Myxinidae (Cyclostomata: Myxiniformes) using the supermatrix method
by: Young Sun Song, et al.
Published: (2020-12-01) -
Dollo-CDP: a polynomial-time algorithm for the clade-constrained large Dollo parsimony problem
by: Junyan Dai, et al.
Published: (2024-01-01) -
Very few sites can reshape the inferred phylogenetic tree
by: Warren R. Francis, et al.
Published: (2020-07-01)