4850 search results - page 742 / 970 » Approximate Data Structures with Applications |
130
click to vote
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
181
click to vote
BMCBI
2010
15 years 5 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
163
click to vote
ALMOB
2006
15 years 4 months ago
2006
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...
144
Voted
TKDE
2010
15 years 3 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
152
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...