The current search engine model considers users not trustworthy, so no tools are provided to let them specify what they are looking for or in what context, which severely limits wh...
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
Optimized spaced seeds improve sensitivity and specificity in local homology search. Several authors have shown that multiple seeds can have better sensitivity and specificity t...