AbstractFor a set T of rooted binary leaf-labelled trees, we present an algorithm that finds all of the minor-minimal trees that are compatible with T. The running time of this algorithm is polynomial up to the number of trees with this property. This type of problem arises in several areas of classification, particularly evolutionary biology
Abstract: Given k rooted binary trees A t,A2,..,Ak, with labeled leaves, we gen-erate C, a unique sy...
10.1109/TCBB.2010.77IEEE/ACM Transactions on Computational Biology and Bioinformatics841141-114
We investigate the problem of finding a minimal weighted set of edges whose removal results in a gra...
AbstractFor a set T of rooted binary leaf-labelled trees, we present an algorithm that finds all of ...
. A fundamental problem in many areas of classification, and particularly in biology, is the reconst...
The problem of constructing a minimally resolved phylogenetic supertree (i.e., a rootedtree having t...
AbstractWe give an algorithm for finding the set of all rooted trees with labelled leaves having sub...
A basic problem in molecular biology is to rebuild phylogenetic trees (PT) from a set of DNA or prot...
Abstract. We are given a set T = {T1, T2,..., Tk} of rooted binary trees, each Ti leaf-labeled by a ...
We are given a set T = fT1 ; T2 ; : : : ; Tkg of rooted binary trees, each T i leaf-labeled by a sub...
Abstract. We study subtree-prune-and-regraft (SPR) operations on leaf-labelled rooted binary trees, ...
Given a set of trees with leaves labelled from a set L, is there a tree T with leaves labelled by L ...
AbstractA classical problem in phylogenetic tree analysis is to decide whether there is a phylogenet...
The Minimum Evolution (ME) approach to phylogeny estimation has been shown to be statistically consi...
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth min...
Abstract: Given k rooted binary trees A t,A2,..,Ak, with labeled leaves, we gen-erate C, a unique sy...
10.1109/TCBB.2010.77IEEE/ACM Transactions on Computational Biology and Bioinformatics841141-114
We investigate the problem of finding a minimal weighted set of edges whose removal results in a gra...
AbstractFor a set T of rooted binary leaf-labelled trees, we present an algorithm that finds all of ...
. A fundamental problem in many areas of classification, and particularly in biology, is the reconst...
The problem of constructing a minimally resolved phylogenetic supertree (i.e., a rootedtree having t...
AbstractWe give an algorithm for finding the set of all rooted trees with labelled leaves having sub...
A basic problem in molecular biology is to rebuild phylogenetic trees (PT) from a set of DNA or prot...
Abstract. We are given a set T = {T1, T2,..., Tk} of rooted binary trees, each Ti leaf-labeled by a ...
We are given a set T = fT1 ; T2 ; : : : ; Tkg of rooted binary trees, each T i leaf-labeled by a sub...
Abstract. We study subtree-prune-and-regraft (SPR) operations on leaf-labelled rooted binary trees, ...
Given a set of trees with leaves labelled from a set L, is there a tree T with leaves labelled by L ...
AbstractA classical problem in phylogenetic tree analysis is to decide whether there is a phylogenet...
The Minimum Evolution (ME) approach to phylogeny estimation has been shown to be statistically consi...
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth min...
Abstract: Given k rooted binary trees A t,A2,..,Ak, with labeled leaves, we gen-erate C, a unique sy...
10.1109/TCBB.2010.77IEEE/ACM Transactions on Computational Biology and Bioinformatics841141-114
We investigate the problem of finding a minimal weighted set of edges whose removal results in a gra...
DOI
Add to ORKG