Premium
Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees
Author(s) -
Baum Bernard R.
Publication year - 1992
Publication title -
taxon
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.819
H-Index - 81
eISSN - 1996-8175
pISSN - 0040-0262
DOI - 10.2307/1222480
Subject(s) - pairwise comparison , phylogenetic tree , inference , tree (set theory) , data set , supertree , tree rearrangement , set (abstract data type) , raw data , biological data , computer science , phylogenetic network , data mining , mathematics , artificial intelligence , biology , statistics , gene , bioinformatics , combinatorics , genetics , programming language
Summary Baum, B. R.: Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. ‐ Taxoni 41: 3–10. 1992. ‐ ISSN 0040‐0262. A procedure of combining trees obtained from data sets of different kinds, similar to Brooks's technique but for a different purpose, with the aim of combining these data sets, is detailed along with examples used in five unrepeated combinations from a total of 15 published datasets. The procedure does not adjoin raw data sets, but instead combines the binary‐coded factors of the trees, each tree from a different data set, together. This allows the combining of data that are only available as pairwise distances with data obtained directly from characters of the organisms. It economizes the analysis of combined nucleotide sequence data which can be very large, and preserves information for each kind of data in the combination. The procedure allows for missing data as well, and can be regarded as a new consensus method ‐ mathematical properties have yet to be investigated. The desirability of combining gene trees, obtained from molecular data, to enable the inference of species trees is discussed in light of using this procedure.