|
A supertree is a single phylogenetic tree assembled from a combination of smaller phylogenetic trees, which may have been assembled using different datasets (e.g. morphological and molecular) or a different selection of taxa. Supertree algorithms can highlight areas where additional data would most usefully resolve any ambiguities.〔(【引用サイトリンク】title=Supertree: Introduction )〕 The input trees of a supertree should behave as samples from the larger tree. == Construction methods == The construction of a supertree scales exponentially with the number of taxa included; therefore for a tree of any reasonable size it is not possible to examine every possible supertree and weigh its success at combining the input information. Heuristic methods are thus essential, although these methods are vulnerable to biases; the result extracted is often biased or affected by irrelevant characteristics of the input data.〔 The Robinson-Foulds distance is the most popular of many ways of measuring how similar a supertree is to the input trees. It is a metric for the number of clades from the input trees that are retained in the supertree. Robinson-Foulds optimization methods search for a supertree that minimizes the total (summed) Robinson-Foulds differences between the (binary) supertree and each input tree.〔 A recent innovation has been the construction of Maximum Likelihood supertrees and the use of "input-tree-wise" likelihood scores to perform tests of two supertrees. Additional methods include the Min Cut Supertree approach, Most Similar Supertree Analysis (MSSA), Distance Fit (DFIT) and Quartet Fit (QFIT), implemented in the software CLANN. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Supertree」の詳細全文を読む スポンサード リンク
|