@Article{fleischauer17bad,
  author    = {Markus Fleischauer and Sebastian B\"ocker},
  title     = {{B}ad {C}lade {D}eletion Supertrees: A Fast and Accurate Supertree Algorithm},
  journal   = {Mol Biol Evol},
  year      = {2017},
  volume    = {34},
  pages     = {2408-2421},
  abstract  = {Supertree methods merge a set of overlapping phylogenetic trees into a supertree containing all taxa of the input trees. The challenge in supertree reconstruction is the way of dealing with conflicting information in the input trees. Many different algorithms for different objective functions have been suggested to resolve these conflicts. In particular, there exist methods based on encoding the source trees in a matrix, where the supertree is constructed applying a local search heuristic to optimize the respective objective function. We present a novel heuristic supertree algorithm called Bad Clade Deletion (BCD) supertrees. It uses minimum cuts to delete a locally minimal number of columns from such a matrix representation so that it is compatible. This is the complement problem to Matrix Representation with Compatibility (Maximum Split Fit). Our algorithm has guaranteed polynomial worst-case running time and performs swiftly in practice. Different from local search heuristics, it guarantees to return the directed perfect phylogeny for the input matrix, corresponding to the parent tree of the input trees, if one exists. Comparing supertrees to model trees for simulated data, BCD shows a better accuracy (F1-score) than the state-of-the-art algorithms SuperFine (up to 3\%) and Matrix Representation with Parsimony (up to 7\%); at the same time, BCD is up to 7 times faster than SuperFine, and up to 600 times faster than Matrix Representation with Parsimony. Finally, using the BCD supertree as a starting tree for a combined Maximum Likelihood analysis using RAxML, we reach significantly improved accuracy (1\% higher F1-score) and running time (1.7-fold speedup).},
  doi       = {10.1093/molbev/msx191},
  keywords  = {jena; supertrees; bcd supertrees;},
  owner     = {Sebastian},
  pmid      = {28873954},
  timestamp = {2017.06.25},
}

{"_id":"NfyKrtksFKawdXHZC","bibbaseid":"fleischauer-bcker-badcladedeletionsupertreesafastandaccuratesupertreealgorithm-2017","authorIDs":[],"author_short":["Fleischauer, M.","Böcker, S."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Markus"],"propositions":[],"lastnames":["Fleischauer"],"suffixes":[]},{"firstnames":["Sebastian"],"propositions":[],"lastnames":["Böcker"],"suffixes":[]}],"title":"Bad Clade Deletion Supertrees: A Fast and Accurate Supertree Algorithm","journal":"Mol Biol Evol","year":"2017","volume":"34","pages":"2408-2421","abstract":"Supertree methods merge a set of overlapping phylogenetic trees into a supertree containing all taxa of the input trees. The challenge in supertree reconstruction is the way of dealing with conflicting information in the input trees. Many different algorithms for different objective functions have been suggested to resolve these conflicts. In particular, there exist methods based on encoding the source trees in a matrix, where the supertree is constructed applying a local search heuristic to optimize the respective objective function. We present a novel heuristic supertree algorithm called Bad Clade Deletion (BCD) supertrees. It uses minimum cuts to delete a locally minimal number of columns from such a matrix representation so that it is compatible. This is the complement problem to Matrix Representation with Compatibility (Maximum Split Fit). Our algorithm has guaranteed polynomial worst-case running time and performs swiftly in practice. Different from local search heuristics, it guarantees to return the directed perfect phylogeny for the input matrix, corresponding to the parent tree of the input trees, if one exists. Comparing supertrees to model trees for simulated data, BCD shows a better accuracy (F1-score) than the state-of-the-art algorithms SuperFine (up to 3%) and Matrix Representation with Parsimony (up to 7%); at the same time, BCD is up to 7 times faster than SuperFine, and up to 600 times faster than Matrix Representation with Parsimony. Finally, using the BCD supertree as a starting tree for a combined Maximum Likelihood analysis using RAxML, we reach significantly improved accuracy (1% higher F1-score) and running time (1.7-fold speedup).","doi":"10.1093/molbev/msx191","keywords":"jena; supertrees; bcd supertrees;","owner":"Sebastian","pmid":"28873954","timestamp":"2017.06.25","bibtex":"@Article{fleischauer17bad,\n author = {Markus Fleischauer and Sebastian B\\\"ocker},\n title = {{B}ad {C}lade {D}eletion Supertrees: A Fast and Accurate Supertree Algorithm},\n journal = {Mol Biol Evol},\n year = {2017},\n volume = {34},\n pages = {2408-2421},\n abstract = {Supertree methods merge a set of overlapping phylogenetic trees into a supertree containing all taxa of the input trees. The challenge in supertree reconstruction is the way of dealing with conflicting information in the input trees. Many different algorithms for different objective functions have been suggested to resolve these conflicts. In particular, there exist methods based on encoding the source trees in a matrix, where the supertree is constructed applying a local search heuristic to optimize the respective objective function. We present a novel heuristic supertree algorithm called Bad Clade Deletion (BCD) supertrees. It uses minimum cuts to delete a locally minimal number of columns from such a matrix representation so that it is compatible. This is the complement problem to Matrix Representation with Compatibility (Maximum Split Fit). Our algorithm has guaranteed polynomial worst-case running time and performs swiftly in practice. Different from local search heuristics, it guarantees to return the directed perfect phylogeny for the input matrix, corresponding to the parent tree of the input trees, if one exists. Comparing supertrees to model trees for simulated data, BCD shows a better accuracy (F1-score) than the state-of-the-art algorithms SuperFine (up to 3\\%) and Matrix Representation with Parsimony (up to 7\\%); at the same time, BCD is up to 7 times faster than SuperFine, and up to 600 times faster than Matrix Representation with Parsimony. Finally, using the BCD supertree as a starting tree for a combined Maximum Likelihood analysis using RAxML, we reach significantly improved accuracy (1\\% higher F1-score) and running time (1.7-fold speedup).},\n doi = {10.1093/molbev/msx191},\n keywords = {jena; supertrees; bcd supertrees;},\n owner = {Sebastian},\n pmid = {28873954},\n timestamp = {2017.06.25},\n}\n\n","author_short":["Fleischauer, M.","Böcker, S."],"key":"fleischauer17bad","id":"fleischauer17bad","bibbaseid":"fleischauer-bcker-badcladedeletionsupertreesafastandaccuratesupertreealgorithm-2017","role":"author","urls":{},"keyword":["jena; supertrees; bcd supertrees;"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:29:35.109Z","downloads":0,"keywords":["jena; supertrees; bcd supertrees;"],"search_terms":["bad","clade","deletion","supertrees","fast","accurate","supertree","algorithm","fleischauer","böcker"],"title":"Bad Clade Deletion Supertrees: A Fast and Accurate Supertree Algorithm","year":2017,"dataSources":["C5FtkvWWggFfMJTFX"]}