Sciweavers

91 search results - page 2 / 19
» A supertree method for rooted trees
Sort
View
PR
2007
81views more  PR 2007»
13 years 4 months ago
Graph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
Andrea Torsello, Edwin R. Hancock
WABI
2009
Springer
127views Bioinformatics» more  WABI 2009»
13 years 12 months ago
Constructing Majority-Rule Supertrees
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
Jianrong Dong, David Fernández-Baca, Fred R...
DAM
2010
112views more  DAM 2010»
13 years 5 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
TCIAIG
2010
13 years 1 days ago
Evaluating Root Parallelization in Go
Abstract--Parallelizing Monte-Carlo tree search has been considered to be a way to improve the strength of computer Go programs. In this paper, we analyze the performance of two ro...
Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe
RECOMB
2011
Springer
12 years 8 months ago
Algorithms for MDC-Based Multi-locus Phylogeny Inference
One of the criteria for inferring a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is minimize ...
Yun Yu, Tandy Warnow, Luay Nakhleh