AbstractWe give an algorithm for finding the set of all rooted trees with labelled leaves having subtrees homeomorphic to each of a given set of rooted trees with labelled leaves. This type of problem arises in the study of evolutionary trees
Abstract. We study subtree-prune-and-regraft (SPR) operations on leaf-labelled rooted binary trees, ...
The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to ...
AMS Subject Classication: 05C05, 92D15 Abstract. We study subtree-prune-and-regraft (SPR) operations...
AbstractWe give an algorithm for finding the set of all rooted trees with labelled leaves having sub...
We are given a set T = fT 1 ; T 2 ; : : : ; T k g of rooted binary trees, each T i leaf-labeled by a...
Given a set of trees with leaves labelled from a set L, is there a tree T with leaves labelled by L ...
Abstract. We are given a set T = {T1, T2,..., Tk} of rooted binary trees, each Ti leaf-labeled by a ...
AbstractFor a set T of rooted binary leaf-labelled trees, we present an algorithm that finds all of ...
Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology....
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a sub...
The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree...
. A fundamental problem in many areas of classification, and particularly in biology, is the reconst...
Abstract. Leaf-labelled trees are widely used to describe evolutionary relationships, particularly i...
Most supertree algorithms combine collections of rooted phylogenetic trees with overlapping leaf set...
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists o...
Abstract. We study subtree-prune-and-regraft (SPR) operations on leaf-labelled rooted binary trees, ...
The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to ...
AMS Subject Classication: 05C05, 92D15 Abstract. We study subtree-prune-and-regraft (SPR) operations...
AbstractWe give an algorithm for finding the set of all rooted trees with labelled leaves having sub...
We are given a set T = fT 1 ; T 2 ; : : : ; T k g of rooted binary trees, each T i leaf-labeled by a...
Given a set of trees with leaves labelled from a set L, is there a tree T with leaves labelled by L ...
Abstract. We are given a set T = {T1, T2,..., Tk} of rooted binary trees, each Ti leaf-labeled by a ...
AbstractFor a set T of rooted binary leaf-labelled trees, we present an algorithm that finds all of ...
Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology....
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a sub...
The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree...
. A fundamental problem in many areas of classification, and particularly in biology, is the reconst...
Abstract. Leaf-labelled trees are widely used to describe evolutionary relationships, particularly i...
Most supertree algorithms combine collections of rooted phylogenetic trees with overlapping leaf set...
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists o...
Abstract. We study subtree-prune-and-regraft (SPR) operations on leaf-labelled rooted binary trees, ...
The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to ...
AMS Subject Classication: 05C05, 92D15 Abstract. We study subtree-prune-and-regraft (SPR) operations...
DOI
Add to ORKG