| 2008 |
|---|
| 8 | EE | Pierre Peterlongo,
Julien Allali,
Marie-France Sagot:
Indexing Gapped-Factors Using a Tree.
Int. J. Found. Comput. Sci. 19(1): 71-87 (2008) |
| 7 | EE | Pierre Peterlongo,
Nadia Pisanti,
Frédéric Boyer,
Alair Pereira do Lago,
Marie-France Sagot:
Lossless filter for multiple repetitions with Hamming distance.
J. Discrete Algorithms 6(3): 497-509 (2008) |
| 2007 |
|---|
| 6 | EE | Pierre Peterlongo,
Laurent Noé,
Dominique Lavenier,
Gilles Georges,
Julien Jacques,
Gregory Kucherov,
Mathieu Giraud:
Protein Similarity Search with Subset Seeds on a Dedicated Reconfigurable Hardware.
PPAM 2007: 1240-1248 |
| 2006 |
|---|
| 5 | EE | Pavlos Antoniou,
Jan Holub,
Costas S. Iliopoulos,
Borivoj Melichar,
Pierre Peterlongo:
Finding Common Motifs with Gaps Using Finite Automata.
CIAA 2006: 69-77 |
| 4 | EE | Pierre Peterlongo,
Julien Allali,
Marie-France Sagot:
The gapped-factor tree.
Stringology 2006: 182-196 |
| 2005 |
|---|
| 3 | EE | Pierre Peterlongo,
Nadia Pisanti,
Frédéric Boyer,
Marie-France Sagot:
Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array.
SPIRE 2005: 179-190 |
| 2 | EE | Costas S. Iliopoulos,
James A. M. McHugh,
Pierre Peterlongo,
Nadia Pisanti,
Wojciech Rytter,
Marie-France Sagot:
A first approach to finding common motifs with gaps.
Int. J. Found. Comput. Sci. 16(6): 1145-1154 (2005) |
| 2004 |
|---|
| 1 | EE | Costas S. Iliopoulos,
James A. M. McHugh,
Pierre Peterlongo,
Nadia Pisanti,
Wojciech Rytter,
Marie-France Sagot:
A First Approach to Finding Common Motifs With Gaps.
Stringology 2004: 88-97 |
