Sciweavers

3786 search results - page 255 / 758
» Structure Comparison and Structure Patterns
Sort
View
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 8 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
ACTA
2008
82views more  ACTA 2008»
15 years 6 months ago
Two-tier relaxed heaps
Abstract. We introduce an adaptation of run-relaxed heaps which provides efficient heap operations with respect to the number of element comparisons performed. Our data structure g...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
154
Voted
BMCBI
2006
159views more  BMCBI 2006»
15 years 6 months ago
ProtRepeatsDB: a database of amino acid repeats in genomes
Background: Genome wide and cross species comparisons of amino acid repeats is an intriguing problem in biology mainly due to the highly polymorphic nature and diverse functions o...
Mridul K. Kalita, Gowthaman Ramasamy, Sekhar Durai...
AI
2011
Springer
15 years 1 months ago
Representing preferences using intervals
In this paper we present a general framework for the comparison of intervals when preference relations have to established. The use of intervals in order to take into account impr...
Meltem Öztürk, Marc Pirlot, Alexis Tsouk...
KDD
2002
ACM
154views Data Mining» more  KDD 2002»
16 years 6 months ago
Mining Protein Contact Maps
The 3D conformation of a protein may be compactly represented in a symmetrical, square, boolean matrix of pairwise, inter-residue contacts, or "contact map". The contact...
Jingjing Hu, Xiaolan Shen, Yu Shao, Chris Bystroff...