| 2006 |
|---|
| 10 | EE | Nadia Pisanti,
Alexandra M. Carvalho,
Laurent Marsan,
Marie-France Sagot:
RISOTTO: Fast Extraction of Motifs with Mismatches.
LATIN 2006: 757-768 |
| 2005 |
|---|
| 9 | EE | Nadia Pisanti,
Henry Soldano,
Mathilde Carpentier:
Incremental Inference of Relational Motifs with a Degenerate Alphabet.
CPM 2005: 229-240 |
| 8 | 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 |
| 7 | EE | Nadia Pisanti,
Maxime Crochemore,
Roberto Grossi,
Marie-France Sagot:
Bases of Motifs for Generating Repeated Patterns with Wild Cards.
IEEE/ACM Trans. Comput. Biology Bioinform. 2(1): 40-50 (2005) |
| 6 | 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 |
|---|
| 5 | 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 |
| 4 | EE | Valentina Ciriani,
Nadia Pisanti,
Anna Bernasconi:
Room allocation: a polynomial subcase of the quadratic assignment problem.
Discrete Applied Mathematics 144(3): 263-269 (2004) |
| 2003 |
|---|
| 3 | EE | Nadia Pisanti,
Maxime Crochemore,
Roberto Grossi,
Marie-France Sagot:
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum.
MFCS 2003: 622-631 |
| 2 | EE | Nadia Pisanti,
Roberto Marangoni,
Paolo Ferragina,
Antonio Frangioni,
A. Savona,
C. Pisanelli,
Fabrizio Luccio:
PaTre: A Method for Paralogy Trees Construction.
Journal of Computational Biology 10(5): 791-802 (2003) |
| 2002 |
|---|
| 1 | EE | Nadia Pisanti,
Marie-France Sagot:
Further Thoughts on the Syntenic Distance between Genomes.
Algorithmica 34(2): 157-180 (2002) |
