25 search results - page 4 / 5 » The Largest Compatible Subset Problem for Phylogenetic Data |
BIBE
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
In this paper we consider the problem of outlier removal for large scale multiview reconstruction problems. An efficient and very popular method for this task is RANSAC. However, a...
ICML
2002
IEEE
14 years 8 months ago
2002
IEEE
In a multi-view problem, the features of the domain can be partitioned into disjoint subsets (views) that are sufficient to learn the target concept. Semi-supervised, multi-view a...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Multi-view algorithms, such as co-training and co-EM, utilize unlabeled data when the available attributes can be split into independent and compatible subsets. Co-EM outperforms ...
BMCBI
2004
13 years 7 months ago
2004
Background: Computational gene prediction continues to be an important problem, especially for genomes with little experimental data. Results: I introduce the SNAP gene finder whi...