4541 search results - page 328 / 909 » Cache-Oblivious Algorithms and Data Structures |
122
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...
132
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Non-homology based methods such as phylogenetic profiles are effective for predicting functional relationships between proteins with no considerable sequence or struct...
157
Voted
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...
128
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
134
click to vote
CPM
2005
Springer
15 years 9 months ago
2005
Springer
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...