Your browser doesn't support javascript.
loading
Extracting conflict-free information from multi-labeled trees.
Algorithms Mol Biol ; 8(1): 18, 2013 Jul 09.
Artigo em Inglês | MEDLINE | ID: mdl-23837994
ABSTRACT

BACKGROUND:

A multi-labeled tree, or MUL-tree, is a phylogenetic tree where two or more leaves share a label, e.g., a species name. A MUL-tree can imply multiple conflicting phylogenetic relationships for the same set of taxa, but can also contain conflict-free information that is of interest and yet is not obvious.

RESULTS:

We define the information content of a MUL-tree T as the set of all conflict-free quartet topologies implied by T, and define the maximal reduced form of T as the smallest tree that can be obtained from T by pruning leaves and contracting edges while retaining the same information content. We show that any two MUL-trees with the same information content exhibit the same reduced form. This introduces an equivalence relation among MUL-trees with potential applications to comparing MUL-trees. We present an efficient algorithm to reduce a MUL-tree to its maximally reduced form and evaluate its performance on empirical datasets in terms of both quality of the reduced tree and the degree of data reduction achieved.

CONCLUSIONS:

Our measure of conflict-free information content based on quartets is simple and topologically appealing. In the experiments, the maximally reduced form is often much smaller than the original tree, yet retains most of the taxa. The reduction algorithm is quadratic in the number of leaves and its complexity is unaffected by the multiplicity of leaf labels or the degree of the nodes.

Similares

MEDLINE

...
LILACS

LIS

Texto completo: Disponível Coleções: Bases de dados internacionais Base de dados: MEDLINE Idioma: Inglês Revista: Algorithms Mol Biol Ano de publicação: 2013 Tipo de documento: Artigo País de afiliação: Estados Unidos