Add to ORKGAbstract. A deterministic algorithm for building the majority rule con-sensus tree of an input collection of conflicting phylogenetic trees with identical leaf labels is presented. Its worst-case running time is O(nk), where n is the size of the leaf label set and k is the number of input phylo-genetic trees. This is optimal since the input size is Ω(nk). Experimental results show that the algorithm is fast in practice.
In this paper we consider two challenging problems that arise in the context of computing a consensu...
AbstractThe field of bioinformatics is witnessing a rapid and overwhelming accumulation of molecular...
Abstract.—Collections of phylogenetic trees are usually summarized using consensus methods. These me...
Abstract. This paper presents two new deterministic algorithms for constructing consensus trees. Giv...
A consensus tree is a single phylogenetic tree that summarizes the branching structure in a given se...
Abstract. We give a randomized linear-time algorithm for computing the majority rule consensus tree....
10.1007/978-3-642-37195-0_8Lecture Notes in Computer Science (including subseries Lecture Notes in A...
Abstract. Computational heuristics are the primary methods for reconstruction of phylogenetic trees ...
Most supertree methods proposed to date are essentially ad hoc, rather than designed with particular...
International audienceUnderstanding the evolution of a set of genes or species is a fundamental prob...
International audienceUnderstanding the evolution of a set of genes or species is a fundamental prob...
International audienceUnderstanding the evolution of a set of genes or species is a fundamental prob...
A consensus tree is a phylogenetic tree that captures the similarity between a set of conflicting ph...
Supertree methods assemble many smaller phyloge-netic trees, called input trees, into a larger phylo...
Abstract Background Supertree methods combine the phylogenetic information from multiple partially-o...
In this paper we consider two challenging problems that arise in the context of computing a consensu...
AbstractThe field of bioinformatics is witnessing a rapid and overwhelming accumulation of molecular...
Abstract.—Collections of phylogenetic trees are usually summarized using consensus methods. These me...
Abstract. This paper presents two new deterministic algorithms for constructing consensus trees. Giv...
A consensus tree is a single phylogenetic tree that summarizes the branching structure in a given se...
Abstract. We give a randomized linear-time algorithm for computing the majority rule consensus tree....
10.1007/978-3-642-37195-0_8Lecture Notes in Computer Science (including subseries Lecture Notes in A...
Abstract. Computational heuristics are the primary methods for reconstruction of phylogenetic trees ...
Most supertree methods proposed to date are essentially ad hoc, rather than designed with particular...
International audienceUnderstanding the evolution of a set of genes or species is a fundamental prob...
International audienceUnderstanding the evolution of a set of genes or species is a fundamental prob...
International audienceUnderstanding the evolution of a set of genes or species is a fundamental prob...
A consensus tree is a phylogenetic tree that captures the similarity between a set of conflicting ph...
Supertree methods assemble many smaller phyloge-netic trees, called input trees, into a larger phylo...
Abstract Background Supertree methods combine the phylogenetic information from multiple partially-o...
In this paper we consider two challenging problems that arise in the context of computing a consensu...
AbstractThe field of bioinformatics is witnessing a rapid and overwhelming accumulation of molecular...
Abstract.—Collections of phylogenetic trees are usually summarized using consensus methods. These me...