25 search results - page 5 / 5 » The Largest Compatible Subset Problem for Phylogenetic Data |
DKE
2008
13 years 6 months ago
2008
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
ALMOB
2006
13 years 6 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
COCOON
2005
Springer
13 years 12 months ago
2005
Springer
Abstract. Phylogenetic reconstruction from gene-rearrangement data is attracting increasing attention from biologists and computer scientists. Methods used in reconstruction includ...
VLDB
1998
ACM
13 years 10 months ago
1998
ACM
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
EMMCVPR
1999
Springer
13 years 10 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...