{"ddc":["576"],"file_date_updated":"2020-07-14T12:46:11Z","year":"2011","intvolume":"        11","publist_id":"3219","volume":11,"language":[{"iso":"eng"}],"pubrep_id":"372","article_number":"205","_id":"3387","citation":{"ieee":"A. Kupczok, “Split based computation of majority rule supertrees,” <i>BMC Evolutionary Biology</i>, vol. 11, no. 205. BioMed Central, 2011.","mla":"Kupczok, Anne. “Split Based Computation of Majority Rule Supertrees.” <i>BMC Evolutionary Biology</i>, vol. 11, no. 205, 205, BioMed Central, 2011, doi:<a href=\"https://doi.org/10.1186/1471-2148-11-205\">10.1186/1471-2148-11-205</a>.","short":"A. Kupczok, BMC Evolutionary Biology 11 (2011).","ama":"Kupczok A. Split based computation of majority rule supertrees. <i>BMC Evolutionary Biology</i>. 2011;11(205). doi:<a href=\"https://doi.org/10.1186/1471-2148-11-205\">10.1186/1471-2148-11-205</a>","apa":"Kupczok, A. (2011). Split based computation of majority rule supertrees. <i>BMC Evolutionary Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2148-11-205\">https://doi.org/10.1186/1471-2148-11-205</a>","ista":"Kupczok A. 2011. Split based computation of majority rule supertrees. BMC Evolutionary Biology. 11(205), 205.","chicago":"Kupczok, Anne. “Split Based Computation of Majority Rule Supertrees.” <i>BMC Evolutionary Biology</i>. BioMed Central, 2011. <a href=\"https://doi.org/10.1186/1471-2148-11-205\">https://doi.org/10.1186/1471-2148-11-205</a>."},"doi":"10.1186/1471-2148-11-205","has_accepted_license":"1","publication":"BMC Evolutionary Biology","author":[{"last_name":"Kupczok","first_name":"Anne","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Kupczok, Anne"}],"title":"Split based computation of majority rule supertrees","quality_controlled":"1","status":"public","publisher":"BioMed Central","scopus_import":1,"oa":1,"oa_version":"Published Version","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:03:03Z","department":[{"_id":"JoBo"}],"abstract":[{"text":"Background: Supertree methods combine overlapping input trees into a larger supertree. Here, I consider split-based supertree methods that first extract the split information of the input trees and subsequently combine this split information into a phylogeny. Well known split-based supertree methods are matrix representation with parsimony and matrix representation with compatibility. Combining input trees on the same taxon set, as in the consensus setting, is a well-studied task and it is thus desirable to generalize consensus methods to supertree methods. Results: Here, three variants of majority-rule (MR) supertrees that generalize majority-rule consensus trees are investigated. I provide simple formulas for computing the respective score for bifurcating input- and supertrees. These score computations, together with a heuristic tree search minmizing the scores, were implemented in the python program PluMiST (Plus- and Minus SuperTrees) available from http://www.cibiv.at/software/ plumist. The different MR methods were tested by simulation and on real data sets. The search heuristic was successful in combining compatible input trees. When combining incompatible input trees, especially one variant, MR(-) supertrees, performed well. Conclusions: The presented framework allows for an efficient score computation of three majority-rule supertree variants and input trees. I combined the score computation with a heuristic search over the supertree space. The implementation was tested by simulation and on real data sets and showed promising results. Especially the MR(-) variant seems to be a reasonable score for supertree reconstruction. Generalizing these computations to multifurcating trees is an open problem, which may be tackled using this framework.","lang":"eng"}],"date_published":"2011-07-13T00:00:00Z","publication_status":"published","issue":"205","month":"07","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2021-01-12T07:43:08Z","file":[{"checksum":"68da8d04af1b97b4cbe8606e2f92ddd8","relation":"main_file","content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2015-372-v1+1_1471-2148-11-205.pdf","date_updated":"2020-07-14T12:46:11Z","file_id":"5058","date_created":"2018-12-12T10:14:09Z","file_size":465042}],"license":"https://creativecommons.org/licenses/by/4.0/","type":"journal_article","day":"13"}