CPM 2006 | Sciweavers

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

claim paper

Read More »

24

click to vote

CPM
2006
Springer

127views Combinatorics» more CPM 2006»

Common Substrings in Random Strings

14 years 3 months ago

Download www.cs.ucr.edu

Eric Blais, Mathieu Blanchette

claim paper

Read More »

25

click to vote

CPM
2006
Springer

82views Combinatorics» more CPM 2006»

An Improved Algorithm for the Macro-evolutionary Phylogeny Problem

14 years 3 months ago

Download www.cs.ucr.edu

Behshad Behzadi, Martin Vingron

claim paper

Read More »

26

click to vote

CPM
2006
Springer

125views Combinatorics» more CPM 2006»

Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents

14 years 3 months ago

Download www.cs.ucr.edu

Jérémy Barbay, Alexander Golynski, J...

claim paper

Read More »

34

click to vote

CPM
2006
Springer

112views Combinatorics» more CPM 2006»

Local Alignment of RNA Sequences with Arbitrary Scoring Schemes

14 years 3 months ago

Download cs.haifa.ac.il

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...

claim paper

Read More »

27

click to vote

CPM
2006
Springer

108views Combinatorics» more CPM 2006»

Reducing the Space Requirement of LZ-Index

14 years 3 months ago

Download www.dcc.uchile.cl

The LZ-index is a compressed full-text self-index able to represent a

Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakan...