3864 search results - page 577 / 773 » time 2005 |
132
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
In computational biology, gene order data is often modelled as signed permutations. A classical problem in genome comparison is to detect conserved segments in a permutation, that ...
130
click to vote
COORDINATION
2005
Springer
15 years 10 months ago
2005
Springer
With its decoupling of processes in space and time, the shared data space model has proven to be a well-suited solution for developing distributed component-based systems. However,...
179
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
170
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
124
click to vote
CRYPTO
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Assuming an insecure quantum channel and an authenticated classical channel, we propose an unconditionally secure scheme for encrypting classical messages under a shared ...