[1] M. Bouvel, V. Grebinski, and G. Kucherov. Combinatorial search on graphs motivated by bioinformatics applicaitons: a brief survey. In D. Kratsch, editor, Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Metz (France), June 23-25, 2005, volume 3787 of Lecture Notes in Computer Science, pages 16-27. Springer Verlag, 2005. [ bib | DOI | http | .pdf ]
[2] Mathieu Giraud, Pascale Quignon, Élodie Retout, Emmanuelle Morin, Anne-Sophie Valin, Dominique Lavenier, Maud Rimbault, Francis Galibert, and Jacques Nicolas. Assemblage ciblé : recherche d'une famille de gènes sur un génome non assemblé. In Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2005), 2005. [ bib ]
[3] Mathieu Giraud, Laurent Noé, Gregory Kucherov, and Dominique Lavenier. Recherches de motifs et de similarités en bioinformatique : modélisations, solutions logicielles et matérielles. In MajecSTIC, 2005. [ bib ]
[4] Sébastien Tempel, Mathieu Giraud, Israël-César Lerman, Ivab Couée, Abdelhak El Amrani, and Jacques Nicolas. Domain organization within repeated DNA sequences : Application to the study of a new family of transposable elements in arabidopsis thaliana. In poster pour JOBIM 2005, 2005. [ bib ]
[5] Dominique Lavenier and Mathieu Giraud. Reconfigurable Computing, chapter Bioinformatics Applications. Springer, 2005. [ bib | DOI | http | http ]
[6] Stéphane Guyetant, Mathieu Giraud, Ludovic L'Hours, Steven Derrien, Stéphane Rubini, Dominique Lavenier, and Frédéric Raimbault. Cluster of re-configurable nodes for scanning large genomic banks. Parallel Computing, 31(1):73-96, 2005. [ bib | DOI | http ]
[7] Pascale Quignon, Mathieu Giraud, Maud Rimbault, Patricia Lavigne, Sandrine Tacher, Emmanuelle Morin, Élodie Retout, Anne-Sophie Valin, Kerstin Lindblad-Toh, Jacques Nicolas, and Francis Galibert. The dog and rat olfactory receptor repertoires. Genome Biology, 6(10):R83, 2005. [ bib | DOI | http | http ]
[8] Mathieu Giraud and Dominique Lavenier. Dealing with hardware space limits when removing epsilon-transitions in a genomic weighted finite automaton. Journal of Automata, Languages and Combinatorics, 10(2/3), 2005. [ bib | .ps.gz ]
[9] H. Touzet. A linear tree edit distance algorithm for similar ordered trees. In (CPM), volume 3537 of Lecture Notes in Computer Science, pages 334-345. Springer Verlag, 2005. [ bib | DOI | http | .pdf ]
[10] A. Fontaine and H. Touzet. How to detect non-coding RNAs ? In JOBIM, 2005. [ bib | .pdf ]
[11] Dulucq S. and Touzet H. Decomposition algorithms for the tree edit distance problem. Journal of Discrete Algorithms, pages 448-471, 2005. [ bib | DOI | http | .pdf ]
[12] H. Touzet. Structures combinatoires pour l'analyse de génomes. PhD thesis, Université des Sciences et Technologies de Lille, 2005. [ bib | .pdf ]
[13] G. Kucherov, L. Noé, and M. Roytberg. A unifying framework for seed sensitivity and its application to subset seeds. In R Casadio and G Myers, editors, Proceedings of the 5th International Workshop in Algorithms in Bioinformatics (WABI), Mallorca (Spain), volume 3692 of Lecture Notes in Computer Science, pages 251-263. Springer Verlag, 2005. [ bib | DOI | http | .ps.gz | .pdf ]
[14] L. Noé and G. Kucherov. YASS: enhancing the sensitivity of DNA similarity search. Nucleic Acids Research, 33 (web-server issue):W540-W543, 2005. [ bib | DOI | http | .pdf ]
[15] G. Kucherov, L. Noé, and M. Roytberg. Multiseed lossless filtration. IEEE Transactions on Computational Biology and Bioinformatics (TCBB), 2(1):51 - 61, 2005. [ bib | DOI | http | .ps.gz | .pdf ]
[16] L Noé. Recherche de similarités dans les séquences d'ADN: modèles et algorithmes pour la conception de graines efficaces. PhD thesis, Université Henri Poincaré - Nancy, 2005. [ bib | .ps.gz | .pdf ]
[17] A. Coppin, J.-S. Varré, L. Lienard, D. Dauvillée, Y. Guérardel, A. Soyer-Gobillard, M.-O.and Buléon, S. Ball, and S. Tomavo. Evolution of plant-like crystalline storage polysaccharide in the protozoan parasite toxoplasma gondii argues for a red alga ancestry. Journal of Molecular Evolution, 60(2):257-267, 2005. [ bib | DOI | http | .pdf ]