Документ взят из кэша поисковой машины. Адрес
оригинального документа
: http://www.mccme.ru/lifr/pers/raffinot.htm
Дата изменения: Wed Oct 4 13:56:50 2006 Дата индексирования: Tue Oct 2 06:46:45 2012 Кодировка: Поисковые слова: п п п п п п п р п р п р п |
CNRS - Section STIC-07, since October 2000.
Text algorithms, pattern matching, computationnal biology, comparative genomics
G. Navarro and M. Raffinot. Flexible Pattern Matching in Strings - Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, 2002. ISBN 0-521-81307-7.
A. Bergeron, C. Chauve, F. de Montgolfier and M. Raffinot. Computing common intervals of K permutations, with applications to modular decomposition of graphs Conference version with proofs (Compressed PDF). In ESA'2005
M. Habib and C. Paul and M. Raffinot. Maximal Common Connected Sets of Intervals Graphs. In Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, number 3109 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2004.
S. Pasek, A. Bergeron, J.-L. Risler, A. Louis, E. Ollivier, and M. Raffinot. Identification of genomic features using microsyntenies of domains: Domain teams. Genome Research, 15:867-874, 2005 (June).
M.P. Beal, A. Bergeron, S. Corteel, and M. Raffinot. An Algorithmic View of Gene Teams. In Theoretical Computer Science , 320(2-3), pages 955-418, 2004.