Sciweavers

CPM
2006
Springer
115views Combinatorics» more  CPM 2006»
13 years 8 months ago
Statistical Encoding of Succinct Data Structures
Rodrigo González, Gonzalo Navarro
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
13 years 8 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals
CPM
2006
Springer
127views Combinatorics» more  CPM 2006»
13 years 8 months ago
Common Substrings in Random Strings
Eric Blais, Mathieu Blanchette
CPM
2006
Springer
112views Combinatorics» more  CPM 2006»
13 years 8 months ago
Local Alignment of RNA Sequences with Arbitrary Scoring Schemes
Abstract. Local similarity is an important tool in comparative analysis of biological sequences, and is therefore well studied. In particular, the Smith-Waterman technique and its ...
Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren...
CPM
2006
Springer
108views Combinatorics» more  CPM 2006»
13 years 8 months ago
Reducing the Space Requirement of LZ-Index
The LZ-index is a compressed full-text self-index able to represent a
Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakan...
CPM
2006
Springer
92views Combinatorics» more  CPM 2006»
13 years 8 months ago
A Linear Size Index for Approximate Pattern Matching
Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lun...
CPM
2006
Springer
111views Combinatorics» more  CPM 2006»
13 years 8 months ago
Faster Algorithms for Computing Longest Common Increasing Subsequences
Gerth Stølting Brodal, Kanela Kaligosi, Iri...
CPM
2006
Springer
90views Combinatorics» more  CPM 2006»
13 years 8 months ago
Asynchronous Pattern Matching
Amihood Amir