[1] Guillaume Blin, Alain Denise, Serge Dulucq, Claire Herrbach, and Helene Touzet. Alignments of RNA structures. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 7(2):309-322, 2010. [ bib | DOI | http | .pdf ]
[2] Jean-Stéphane Varré. Algorithmes pour la comparaison de génomes et la recherche de signaux cis-régulateurs. Hdr, Université Lille 1, December 2008. [ bib | http | .pdf ]
[3] Aude Liefooghe. Matrices score-position, algorithmes et propriétés. These, Université Lille 1, July 2008. [ bib | http | .pdf ]
[4] Pierre Peterlongo, Laurent Noé, Dominique Lavenier, Van Hoa Nguyen, Gregory Kucherov, and Mathieu Giraud. Optimal neighborhood indexing for protein similarity search. BMC Bioinformatics, 9(534), 2008. [ bib | DOI | http | .pdf ]
[5] Arnaud Fontaine, Antoine de Monte, and Hélène Touzet. MAGNOLIA: multiple alignment of protein-coding and structural RNA sequences. Nucleic Acids Research, Web Server Issue, Vol 36(suppl 2):W14-W18, 2008. [ bib | DOI | http | .pdf ]
[6] Anne Chenuil, Emilie Egea, Caroline Rocher, Hélène Touzet, and Jean-Pierre Féral. Does hybridization increase evolutionary rate ? Data from the 28S-rDNA D8 domain in echinoderms. Journal of Molecular Evolution, 67(5):539-550, 2008. [ bib | DOI | .html | .pdf ]
[7] M. Roytberg, A. Gambin, L. Noé, S. Lasota, E. Furletova, E. Szczurek, and G. Kucherov. Efficient seeding techniques for protein similarity search. In M Elloumi, J. Küng, M. Linial, R.F. Murphy, K. Schneider, and C. Toma, editors, Proceedings of the 2nd Workshop on Algorithms in Molecular Biology (ALBIO'08), Vienna (Austria), July 7-9, 2008, volume 13 of Communications in Computer and Information Science, pages 466-478. Springer Verlag, 2008. [ bib | DOI | http | .ps.gz | .pdf ]
[8] Mathieu Giraud. Not so many runs in strings. In Int. Conf. on Language and Automata Theory and Applications (LATA 08), volume 5196 of Lecture Notes in Computer Science (LNCS), pages 232-239, 2008. [ bib | DOI | .pdf ]
[9] R. Kolpakov and G. Kucherov. Searching for gapped palindromes. In Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM), June 18-20, 2008, Pisa (Italy), volume 5029 of Lecture Notes in Computer Science, pages 18-30. Springer Verlag, 2008. [ bib | DOI | http | .pdf ]
[10] Jean-Émile Symphor, Alban Mancheron, Lionel Vinceslas, and Pascal Poncelet. Le fia : un nouvel automate permettant l'extraction efficace d'itemsets fréquents dans les flots de données. In Proceedings of the 8th Extraction et Gestion des Connaissances (egc), volume RNTI-E-11 (1) of Revue des Nouvelles Technologies de l'Information, pages 157-168. Cépaduès-Éditions, 2008. [ bib | .pdf ]
[11] Sylvain Guillemot. Parameterized complexity and approximability of the SLCS problem. In Proceedings of Parameterized and Exact Computation: Third International Workshop (IWPEC 2008), volume 5018, pages 115-128, Victoria, Canada, 2008. [ bib | DOI | http ]
[12] Sylvain Guillemot. FPT algorithms for path-transversals and cycle-transversals problems in graphs. In Proceedings of Parameterized and Exact Computation: Third International Workshop (IWPEC 2008), volume 5018, pages 129-140, Victoria, Canada, 2008. [ bib | DOI | http ]
[13] Jaroslaw Byrka, Sylvain Guillemot, and Jesper Jansson. New Results on Optimizing Rooted Triplets Consistency. In Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), volume 5369, pages 484-495, Gold Coast, Australie, 2008. [ bib | DOI | http ]
[14] Jesper Jansson and W.-K. Sung. New Topics in Theoretical Computer Science, chapter The Maximum Agreement of Two Nested Phylogenetic Networks, pages 119-141. NOVA Publishers, 2008. [ bib ]
[15] Jesper Jansson. Encyclopedia of Algorithms, chapter Directed Perfect Phylogeny (Binary Characters) - 1991; Gusfield, pages 246-248. Springer, 2008. [ bib | DOI | http ]
[16] Jesper Jansson. Encyclopedia of Algorithms, chapter Perfect Phylogeny (Bounded Number of States) - 1997; Kannan, Warnow, pages 644-647. Springer, 2008. [ bib | DOI | http ]
[17] Jesper Jansson. Encyclopedia of Algorithms, chapter Phylogenetic Tree Construction from a Distance Matrix - 1989; Hein, pages 651-653. Springer, 2008. [ bib | DOI | http ]
[18] G. Kucherov and D. Sokol. Encyclopedia of Algorithms, chapter Approximate Tandem Repeats, pages 48-51. Springer, 2008. [ bib | DOI | http ]
[19] M. Gîrdea, G. Kucherov, and L. Noé. Protein sequence alignment via anti translation. In Proceedings of the 9th Open Days in Biology, Computer Science and Mathematics (JOBIM), June 30-July 2, 2008, Lille (France), pages 157-158, 2008. (short talk with poster). [ bib | .pdf ]
[20] Julien Allali, Yves D'Aubenton-Carafa, Cedric Chauve, Alain Denise, Christine Drevet, Pascal Ferraro, Daniel Gautheret, Claire Herrbach, Fabrice Leclerc, Antoine De Monte, Aïda Ouangraoua, Marie-France Sagot, C. Saule, Michel Termier, Claude Thermes, and Helene Touzet. Benchmarking RNA secondary structure comparison algorithms. In Actes des Journées Ouvertes de Biologie, Informatique et Mathématiques, pages 67-68, Lille, France, 2008. (short talk with poster). [ bib | http ]
[21] Ségolène Caboche, Maude Pupin, Valérie Leclère, Philippe Jacques, and Gregory Kucherov. NORINE: a platform dedicated to nonribosomal peptides, 2008. 9th Open Days in Biology, Computer Science and Mathematics (JOBIM), June 30-July 2, 2008, Lille (France). [ bib ]
[22] Ségolène Caboche, Maude Pupin, Valérie Leclère, Philippe Jacques, and Gregory Kucherov. NORINE: a public resource for nonribosomal peptides, 2008. EMBnet 2008 - 20th Anniversary Conference. [ bib | http | .pdf ]
[23] Ségolène Caboche, Maude Pupin, Valérie Leclère, Philippe Jacques, and Gregory Kucherov. NORINE: database and efficient algorithms dedicated to nonribosomal peptides, 2008. ECCB08 European Conference on Computational Biology. [ bib | http ]
[24] A. Darracq, J.-S. Varré, A. Courseaux, L. Maréchal-Drouard, and P. Touzet. Evolution of the mitochondrial genome in beet. a comparative genomic study at the intra-specific level, 2008. XX International Congress of Genetics. [ bib ]
[25] Lionel Vinceslas, Jean-Émile Symphor, Alban Mancheron, and Pascal Poncelet. FIASCO : un nouvel algorithme d'extraction d'itemsets fréquents dans les flots de données. In Proceedings of the 8th Extraction et Gestion des Connaissances (EGC), volume RNTI-E-11 (1) of Revue des Nouvelles Technologies de l'Information, pages 235-236. Cépaduès-Éditions, 2008. [ bib ]