| 2008 |
|---|
| 21 | EE | François Nicolas,
Eric Rivals:
Hardness of optimal spaced seed design.
J. Comput. Syst. Sci. 74(5): 831-849 (2008) |
| 2007 |
|---|
| 20 | EE | François Nicolas,
Eric Rivals:
Longest common subsequence problem for unoriented and cyclic strings.
Theor. Comput. Sci. 370(1-3): 1-18 (2007) |
| 2006 |
|---|
| 19 | EE | Olivier Bodini,
Eric Rivals:
Tiling an Interval of the Discrete Line.
CPM 2006: 117-128 |
| 2005 |
|---|
| 18 | EE | François Nicolas,
Eric Rivals:
Hardness of Optimal Spaced Seed Design.
CPM 2005: 144-155 |
| 17 | EE | François Nicolas,
Eric Rivals:
Hardness results for the center and median string problems under the weighted and unweighted edit distances.
J. Discrete Algorithms 3(2-4): 390-415 (2005) |
| 2004 |
|---|
| 16 | EE | Olivier Delgrange,
Eric Rivals:
STAR: an algorithm to Search for Tandem Approximate Repeats.
Bioinformatics 20(16): 2812-2820 (2004) |
| 15 | EE | Eric Rivals:
A Survey On Algorithmic Aspects Of Tandem Repeats Evolution.
Int. J. Found. Comput. Sci. 15(2): 225-257 (2004) |
| 2003 |
|---|
| 14 | EE | François Nicolas,
Eric Rivals:
Complexities of the Centre and Median String Problems.
CPM 2003: 315-327 |
| 13 | | Sven Rahmann,
Eric Rivals:
On The Distribution Of The Number Of Missing Words In Random Texts.
Combinatorics, Probability & Computing 12(1): (2003) |
| 12 | EE | Eric Rivals,
Sven Rahmann:
Combinatorics of periods in strings.
J. Comb. Theory, Ser. A 104(1): 95-113 (2003) |
| 11 | EE | Sèverine Bérard,
Eric Rivals:
Comparison of Minisatellites.
Journal of Computational Biology 10(3/4): 357-372 (2003) |
| 2002 |
|---|
| 10 | EE | Sèverine Bérard,
Eric Rivals:
Comparison of minisatellites.
RECOMB 2002: 67-76 |
| 2001 |
|---|
| 9 | EE | Eric Rivals,
Sven Rahmann:
Combinatorics of Periods in Strings.
ICALP 2001: 615-626 |
| 2000 |
|---|
| 8 | EE | Sven Rahmann,
Eric Rivals:
Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts.
CPM 2000: 375-387 |
| 1999 |
|---|
| 7 | EE | Olivier Delgrange,
Max Dauchet,
Eric Rivals:
Location of Repetitive Regions in Sequences By Optimizing A Compression Method.
Pacific Symposium on Biocomputing 1999: 254-265 |
| 6 | EE | Stefan Burkhardt,
Andreas Crauser,
Paolo Ferragina,
Hans-Peter Lenhof,
Eric Rivals,
Martin Vingron:
q-gram based database searching using a suffix array (QUASAR).
RECOMB 1999: 77-83 |
| 5 | | Jean-Stéphane Varré,
Jean-Paul Delahaye,
Eric Rivals:
Transformation distances: a family of dissimilarity measures based on movements of segments.
Bioinformatics 15(3): 194-202 (1999) |
| 1998 |
|---|
| 4 | | Jean-Stéphane Varré,
Jean-Paul Delahaye,
Eric Rivals:
The transformation distance: A dissimilarity measure based an movements of segments.
German Conference on Bioinformatics 1998 |
| 3 | EE | Eric Rivals,
Jean-Paul Delahaye:
Optimal Representation in Average Using Kolmogorov Complexity.
Theor. Comput. Sci. 200(1-2): 261-287 (1998) |
| 1997 |
|---|
| 2 | | Eric Rivals,
Olivier Delgrange,
Jean-Paul Delahaye,
Max Dauchet,
Marie-Odile Delorme,
Alain Hénaut,
Emmanuelle Ollivier:
Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences.
Computer Applications in the Biosciences 13(2): 131-136 (1997) |
| 1996 |
|---|
| 1 | | Eric Rivals,
Jean-Paul Delahaye,
Max Dauchet,
Olivier Delgrange:
A Guaranteed Compression Scheme for Repetitive DNA Sequences.
Data Compression Conference 1996: 453 |
