1083 search results - page 12 / 217 » Efficient Discovery of Confounders in Large Data Sets |
BMCBI
2011
12 years 11 months ago
2011
Background: Results of phylogenetic analysis are often visualized as phylogenetic trees. Such a tree can typically only include up to a few hundred sequences. When more than a few...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
CGA
1999
13 years 7 months ago
1999
displays to abstract network data and let users interactwithit.Wehaveimplementedafull-scaleSwift3D prototype, which generated the examples we present here. Swift-3D We developed Sw...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...