Sciweavers

SPIRE
2005
Springer
13 years 9 months ago
Cache-Conscious Collision Resolution in String Hash Tables
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
Nikolas Askitis, Justin Zobel
SPIRE
2005
Springer
13 years 9 months ago
Necklace Swap Problem for Rhythmic Similarity Measures
Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing th...
Yoan José Pinzón Ardila, Raphaë...
SPIRE
2005
Springer
13 years 9 months ago
Composite Pattern Discovery for PCR Application
We consider the problem of finding pairs of short patterns such that, in a given input sequence of length n, the distance between each pair’s patterns is at least α. The proble...
Stanislav Angelov, Shunsuke Inenaga
SPIRE
2005
Springer
13 years 9 months ago
A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison
Abstract. We introduce a new data structure, called MiGaL for “Multiple Graph Layers”, that is composed of various graphs linked together ions of abstraction/refinement. The n...
Julien Allali, Marie-France Sagot
SPIRE
2005
Springer
13 years 9 months ago
An Edit Distance Between RNA Stem-Loops
We introduce the notion of conservative edit distance and mapping between two RNA stem-loops. We show that unlike the general edit distance between RNA secondary structures, the co...
Valentin Guignon, Cedric Chauve, Sylvie Hamel