25 search results - page 2 / 5 » The Largest Compatible Subset Problem for Phylogenetic Data |
ISBRA
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Many of the steps in phylogenetic reconstruction can be confounded by “rogue” taxa, taxa that cannot be placed with assurance anywhere within the tree—whose locatio...
KCAP
2011
ACM
12 years 7 months ago
2011
ACM
With billions of assertions and counting, the Web of Data represents the largest multi-contributor interlinked knowledge base that ever existed. We present a novel framework for a...
ICML
2002
IEEE
14 years 5 months ago
2002
IEEE
Multi-view algorithms reduce the amount of required training data by partitioning the domain features into separate subsets or views that are sufficient to learn the target concep...
SOFSEM
2007
Springer
13 years 10 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
DAM
2010
13 years 4 months ago
2010
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...