Guillaume Blin

Civil Status

Scientific Training

• 2002-2005 -- Doctorate at Université de Nantes, in Computer Science, defended the 17th of november 2005, with first-class honors.
  • Title: Combinatoire et Bio-informatique: Comparaison de structures d’ARN et Calcul de distances intergénomiques
  • Place of defence: UFR Sciences et Techniques, Université de Nantes
  • Phd supervisor: Irena RUSU, Full-Professor, Université de Nantes
  • Phd coordinator: Guillaume FERTIN, Full-Professor, Université de Nantes
  • Laboratory: Laboratoire d’Informatique de Nantes Atlantique (UMR CNRS 6241), Combinatoire et Bio-informatique (ComBi) team
  • Grant: Ministerial MENRT grant as a junior-lecturer
  • Jury:
    • President: Guillaume FERTIN, Full-Professor, Université de Nantes
    • Reviewers:
      • Marie-France SAGOT,Research Director,INRIA Rhône-Alpes
      • Hélène TOUZET, Research Director CNRS (DR2), Université de Lille
    • Examinators:
      • Romeo RIZZI, Full-Professor, Universita degli Studi di Trento (Italy)
      • Irena RUSU, Full-Professor, Université de Nantes
      • Stéphane VIALETTE, Full-Researcher CNRS (DR2), Université de Marne la Vallée
  • 2001-2002 -- Master Thesis in Computer Science at Université de Nantes
    • Title: Construction d’un environnement d’opérationalisation d’ontologies
    • Topic: Artificial Intelligence
    • Date of defence: September 2002
    • Place of defence: UFR Sciences et Techniques, Université de Nantes
    • Scientific coordinators:
      • Michel LECLERE, Associate-Professor, Université de Montpellier 2
      • Franky TRICHET, Associate-Professor, Université de Nantes
    • Laboratory: Institut de Recherche en Informatique de Nantes (IRIN)
  Coordonnées :: Formation Universitaire
  Formation Professionnelle :: Enseignements :: Publis

  Professional Training

  • 2011-2012 -- 6 months of CRCT at Université de Marne la Vallée for handling the HAL project
  • 2010-2011 -- Full Temporary CNRS Researcher at Université de Marne la Vallée
  • From 2006 -- Associate-Professor at Université de Marne la Vallée
  • 2005-2006 -- Assistant-Professor at Université de Marne la Vallée
  • 2002-2005 -- Junior-Lecturer - MENRT grant - Université de Nantes
  • 2000-2002 -- Temporary Lecturer at Université de Nantes

  Teaching Experiences

  All quantities are given in TD's hours

  • 2000-2002 – 127h equi. TDs as a junior assitant professor
    • UFR Droit Nantes – M1 : Bureautique (100h TP)
    • IUT Informatique Nantes – 2ème année : Réseaux Protocoles et Services (38h TD)
    • IUT Informatique Nantes – Licence Pro : Client/Serveur, Traitement Répartis (10h TP) ; Interface Homme Machine (23h TP)
  • 2002-2005 – 219h equi. TDs as a MENRT junior assisant professor
    • Fac. Science de Nantes – L2 : CAML (30h TP)
    • Fac. Science de Nantes – L3 : Architecture des ordinateurs (63h TD, 72h TP); Système d’exploitation (27h TD, 8h TP)
    • Fac. Science de Nantes – M1 : Algorithmique avancée (25h TP)
    • Fac. Science de Nantes – L MIAGE : SGBD (14h TP); Architecture des ordinateurs (20h TD,15h TP)
  • 2005-2006 – 94h equi. TDs as an assistant professor of Université de Marne-la-vallée
    • IR2 : Système d’exploitation (14h TD)
    • L1 : HTML (20h TD); SGBD (36h TD)
    • L3 : Architecture des ordinateurs (24h TD)
  • 2006-2010 – 230h equi. TDs per year (in average) on, among others:
    • Master 1 : Soutenance de stages, Java Avancé, Java Réseau, Informatique Génomique
    • Licence 3 : Architecture des ordinateurs, Réseaux
    • IR 1 : Algorithmique, Architecture des ordinateurs, Programmation C
    • IR 2 : Java Avancé, Concurrence et E/S, Applications réseaux
    • IR 3 : XML et XSLT
    • OC 1 : Architecture des ordinateurs
  • 2010-2011 - No teaching
  • 2011-2012 - 92h equi. TDs (due to an half period of CRCT):
    • IMAC 1 : Algorithmique

  Scientific Duties

  Local duties

  From 2006, I am co-organizing the weekly general seminar of the Laboratoire d’Informatique Gaspard Monge. Moreover, in 2008, I co-organized an interdisciplinary workgroup called “RécréAlgo” which aims at puting together skills of researchers of different domains (but all linked to the theoretical computer science) around hard algorithmic problems. Note that the idea gave rise to a new workgroup in the context of the LABEX Bézout organized by Cyril Nicaud.

  I am also, from 2006, responsible of the bibliography of the laboratory. In order to facilitate the update of this last, I have developed a tool allowing to any member of the laboratory to manage its bibliography entries. This tool also allows an automatic update of the web pages relative to the publications of the laboratory. As a consequence to this experience, I have been asked to be in charge of expending such tool at the scale of the Université Paris-Est based on the tool HAL which leads to the actual HAL portal http://hal-univ-mlv.archives-ouvertes.fr.

  Moreover, in collaboration with colleagues, we have implemented, in 2006, a shared teaching area allowing a collaborative work between teachers, reachable by our students and widely used.

  Finally, I am responsible of the web page of the laboratory from 2009 and at the initiative of its new shape.

  Committees

  During the recruitment process of associate professors in 2009, I have been a member of the “selection committee” of the a) LIGM - Université de Marne-la-Vallée, b) LRI - IUT d’Orsay and c) LIFL - Faculté des sciences de Lille 1 (each for an associate-professor position). In 2010, I have, once again, been a member of the selection committee of the LRI - IUT d’Orsay. In 2011, I have been a member of the the selection committee of the a) LIGM - Université de Marne-la-Vallée and b) LRI - Faculté d’Orsay. In 2012, I have been a member of the selection committee of the LABRI - Université de Bordeaux. From January 2010, I am a member of the permanent committee and of the laboratory board of the LIGM.

  I have been an external reviewer, among others, of the following journals: Algorithmica, Discrete Mathematics, Theoretical Computer Science, Journal of Computational Biology, Information Processing Letters, IEEE/ACM Transactions on Computational Biology and Bioinformatics, Journal of Combinatorial Optimization. I have also reviewed extended abstract papers for conferences such as CPM, WABI, SPIRE, STACS, PSB, RECOMB-CG, IWOCA.

  In September 2007, I have co-organized some honorary days for Maxime Crochemore in the context of the journées conjointes des groupes ”Analyse de séquences” du GDR Bio-Informatique Moléculaire et ”Combinatoire des mots, algorithmique du texte et du génome” du GDR Informatique Mathématique in Marne-la-vallée (http://www2.lifl.fr/SEQUOIA/Sequences/). This event has attracted around one hundred researchers. In January and December 2011, I have again co-organized this event in Rennes and Lille respectively (http://www.irisa.fr/symbiose/people/ppeterlongo/seqbi/).

  I have been part of the program committee of RECOMB-CG editions 2008, 2009 and 2010, of WABI 2012. In October 2008, I have been part of the organizing committee of the 2008 edition of RECOMB-CG which took place in Paris, France involving 120 participants and has been published as Lecture Notes in BioInformatics volume n ̊5267 proceedings.

  International Mobility Development

  I have settled (as a local responsible) two Erasmus exchange agreements: one with the Bielefeld University (Germany) which started in 2006 and has allowed a student of our first year of Master in Computer Science to obtain his Master Thesis in Bioinformatic from the Bielefeld University after a year in Germany and the other with the Brno University (Czech Republic) which started in 2009 and allowed two Czech phd students to visit our laboratory for a week in December 2010. A third agreement is nowadays in the preparation phase (with the Milano University (Italy)). Moreover, in 2010, I have applied and obtained an international postdoc mobility grant from the Association Universitaire de la Francophonie for a colleague (PhD David Celestin Faye) from the University Gaston-Berger of Saint-Louis (Senegal) which allowed him to make two short visits (3 months + 1 month) in my laboratory to work on a common project with Olivier Curé and myself. With Dr Faye, we are in the process of extending our collaborations at the laboratory and university levels by exploring Erasmus Mundus agreements.

  Finally, via the process of “invited months”, I have been able to provide some short terms visits to foreign collaborators to work with our team: Sylvie Hamel from Montréal, Canada (1 month in 2008), Jens Stoye from Bielefeld, Germany (1 month in 2008), Romeo Rizzi from Udine, Italy (1 month in 2009), Minghui Jiang from Utah, USA (1 month in 2011), Danny Hermelin from Saarbrucken, Germany (2 weeks in 2010), Xiao Yang from Iowa, USA(1 month in 2010), Riccardo Dondi from Milano, Italy (1 week in 2011), Sylvie Hamel from Montréal, Canada (1 week in 2011) and Xiaodong Wu from Iowa, USA (1 month in 2012).

  Projects and Collaborations

  I have been involved in numerous national and international projects that allowed me to strengthen my set of collaborators. Among those projects, we can mention

  • The Action Spécifique CNRS - Département STIC “Nouveaux modèles et algorithmes de graphes pour la biologie” (2003-2004)
  • The Action Concertée Incitative “Masse de Données NavGraphe” (2003-2006)
  • The Action Concertée Incitative “Nouvelles Interfaces des Mathématiques pi-vert” (2005-2008)
  • The working group “ARENA”, based on the ACI IMPBio (2004-2007)
  • The programme blanc ANR “BRASERO Biologically Relevant Algorithms and Softwares for Efficient RNA Structure Comparison” (2006-2010)
  • A bilateral franco-italian project PAI Galileo n ̊08484VH (2005)
  • A bilateral franco-quebec project from the Commission Permanente de Coopération Franco- Québécoise on “Structures conservées et duplications pour les réarrangements génomiques” (2005-2006)
  • A PEPS CNRS: “Traduction Automatique et Génomique Comparative” (2010-2011)
  • A programme jeune chercheur ANR “Biological networks, Radiotherapy and Structures” (2010-2014) for which I am the coordinator
  • Member of the Laboratoire International Franco-Québécois de Recherche en Combinatoire (Laboratoire International Associé LIRCO)
  • An ”Investissements d’Avenir” program called ABS4NGS for ”Solutions Algorithmiques, Bioinformatiques et Logicielles pour le Séquencage Haut Débit” (2012)

  Some of those projects allowed me to make some short terms international visits: a month in 2005, 15 days in 2009 and 15 days in 2011 at Montréal, CANADA, 15 days in 2005 at Trento, ITALY, 10 days in 2009 at Lisboa, PORTUGAL, 15 days in 2010 at Udine/Milan, ITALY, 20 days in 2011 and 7 days in 2012 at Iowa, USA and 4 days in 2011 at Saarbrucken, GERMANY. These visits demonstrate my mobility skill (altough I am fully investigated in my teaching and scientific duties). It has been the occasion to meet most of my collaborators among which we can cite:

  • Mathieu Blanchette - Montréal, CANADA
  • Paola Bonizzoni - Milano, ITALY
  • Cédric Chauve - Vancouver, CANADA
  • Annie Chateau - Montréal, CANADA
  • Maxime Crochemore - Paris, FRANCE / London, UK
  • Riccardo Dondi - Milano, ITALY
  • Nadia El Mabrouk - Montréal, CANADA
  • David Faye - Saint Louis, SENEGAL
  • Guillaume Fertin - Nantes, FRANCE
  • Pierre Guillon - Nice, FRANCE
  • Minghui Jiang - Utah, USA
  • Sylvie Hamel - Montréal, CANADA
  • Danny Hermelin - Haifa, ISRAEL/Saarbrucken, GERMANY
  • Anthony Labarre - Brussel, BELGIUM
  • Romeo Rizzi - Udine, ITALY
  • Irena Rusu - Nantes, FRANCE
  • Jens Stoye - Bielefeld, GERMANY
  • Hélène Touzet - Lille, FRANCE
  • Stéphane Vialette - Paris, FRANCE
  • Xiaodong Wu - Iowa, USA
  • Xiao Yang - Iowa, USA
  • Michal Ziv Ukelson - Negev, ISRAEL

  PhD Student Supervision

  • Supervision (at 50% with Mr Stéphane Vialette) of a PhD student (MENRT grant) on biological networks – Florian Sikora between 2008 and 2011
  • Supervision (at 50% with Mr Stéphane Vialette) of a PhD student (ANR grant) on radiotherapy – Paul Morel from September 2011

  Publications

  Complete list of my publications

  Book Chapter +/-

  Chapitres d'ouvrages scientifiques

  2011

  Rèf biblio

  Blin Guillaume, Crochemore Maxime, Vialette Stéphane. Algorithmic Aspects of Arc-Annotated Sequences. Elloumi Mourad, Zomaya Albert Y.. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Wiley, pp. 113-126, Feb. 2011

  Accès au bibtex

  

  Journals +/-

  Articles dans des revues avec comité de lecture

  2012

  Rèf biblio

  Blin Guillaume, Rizzi Romeo, Vialette Stéphane. A faster algorithm for finding minimum Tucker submatrices. Theory of Computing Systems, 2012, ? (?), 10 pp.

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Bonizzoni Paola, Dondi Riccardo, Sikora Florian. On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem. Information Processing Letters, 2012, ? (?), 9 pp.

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Faye David Célestin, Curé Olivier, Blin Guillaume. A survey of RDF storage approaches. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, 2012, 15 (1), pp. 25

  Accès au bibtex

  

  2011

  Rèf biblio

  Blin Guillaume, Crochemore Maxime, Hamel Sylvie, Vialette Stéphane. Median of an odd number of permutations. Pure Mathematics and Applications, 2011, 21 (2), pp. 161 - 175

  Accès au bibtex

  

  Rèf biblio

  Blin Guillaume, Rizzi Romeo, Sikora Florian, Vialette Stéphane. Minimum Mosaic Inference of a Set of Recombinants. International Journal of Foundations of Computer Science, 2011, ? (?), pp.17

  Accès au texte intégral et bibtex

  

  2010

  Rèf biblio

  Blin Guillaume, Sikora Florian, Vialette Stéphane. Querying Graphs in Protein-Protein Interactions Networks using Feedback Vertex Set. IEEE/ACM IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2010, 7 (4), pp. 628-635

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Faye David Célestin, Stoye Jens. Finding Nested Common Intervals Efficiently. Journal of Computational Biology, 2010, 17 (9), pp. 1183-1194

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Denise Alain, Dulucq Serge, Herrbach Claire, Touzet Hélène. Alignments of RNA structures.. IEEE/ACM IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2010, 7 (2), pp. 309-322. <http://dx.doi.org/10.1109/TCBB.2008.28>

  Accès au texte intégral et bibtex

  

  2008

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Hermelin Danny, Vialette Stéphane. Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure Constraints. Journal of Discrete Algorithms, 2008, 6 (4), pp. 618-626

  Accès au texte intégral et bibtex

  

  2007

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Vialette Stéphane. Extracting Constrained 2-Interval Subsets in 2-Interval Sets. Theoretical Computer Science, 2007, 385 (1-3), pp. 241-263

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Chauve Cedric, Fertin Guillaume, Rizzi Romeo, Vialette Stéphane. Comparing Genomes with Duplications: a Computational Complexity Point of View. ACM/IEEE Trans. Computational Biology and Bioinformatics, 2007, 4 (4), pp. 523-534

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Blais Eric, Hermelin Danny, Guillon Pierre, Blanchette Mathieu, El-Mabrouk Nadia. Gene Maps Linearization using Genomic Rearrangement Distances. Journal of Computational Biology, 2007, 14 (4), pp. 394-407

  Accès au texte intégral et bibtex

  

  2005

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Rizzi Romeo, Vialette Stéphane. What makes the Arc-Preserving Subsequence problem hard ?. LNCS Transactions on Computational Systems Biology, 2005, 2, pp. 1-36

  Accès au texte intégral et bibtex

  

  Inproceeding +/-

  Communications avec actes

  2012

  Rèf biblio

  Blin Guillaume, Bulteau Laurent, Jiang Minghui, Pedro J. Tejada, Vialette Stéphane. Hardness of longest common subsequence for sequences with bounded run-lengths. Juha Kärkkäinen and Jens Stoye. 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Jul 2012, Helsinki, Finland. Springer-Verlag, 11 pp, Lecture Notes in Computer Science

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Yang Xiao, Sikora Florian, Blin Guillaume, Hamel Sylvie, Rizzi Roméo, Aluru Srinivas. An Algorithmic View on Multi-related-segments: a new unifying model for approximate common interval. Manindra Agrawal, S. Barry Cooper, and Angsheng Li. 9th annual conference on Theory and Applications of Models of Computation (TAMC), May 2012, Beijing, China. Springer-Verlag, 7287, 10pp., LNCS

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Bonizzoni Paola, Dondi Riccardo, Rizzi Romeo, Sikora Florian. Complexity Insights of the Minimum Duplication Problem. 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), Jan 2012, Špindleruv Mlýn, Czech Republic. 19pp.

  Accès au texte intégral et bibtex

  

  2011

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Mohamed-Babou Hafedh, Rusu Irena, Sikora Florian, Vialette Stéphane. Algorithmic Aspects of Heterogeneous Biological Networks Comparison. 5th International Conference on Combinatorial Optimization and Applications (COCOA 2011), 2011, Zhangjiajie, China. Springer, LNCS, pp. 272-286, Lecture Notes in Computer Science

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Rizzi Romeo, Sikora Florian, Vialette Stéphane. Minimum Mosaic Inference of a Set of Recombinants. Potanin Alex and Viglas Taso. 17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. ACS, 119, pp. 23-30, CRPIT

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Rizzi Romeo, Vialette Stéphane. A Polynomial-Time Algorithm for Finding Minimal Conflicting Sets. 6th International Computer Science Symposium in Russia (CSR'11), 2011, St Petersbourg, Russian Federation. 6651, pp. 373-384, Lecture Notes in Computer Science

  Accès au texte intégral et bibtex

  

  2010

  Rèf biblio

  Blin Guillaume, Sikora Florian, Vialette Stéphane. GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks. Hisham Al-Mubaid. Bioinformatics and Computational Biology (BICoB'10), Mar 2010, Honolulu, United States. pp. 38–43, International Society for Computers and their Applications (ISCA)

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Hamel Sylvie, Vialette Stéphane. Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions. Rahman Md. S. and Fujita S.. 4th Workshop on Algorithms and Computation (WALCOM'10), Feb 2010, Dhaka, Bangladesh, Bangladesh. Springer-Verlag, 5942, pp. 149-160, Lecture Notes in Computer Science

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Curé Olivier, Faye David Célestin, Blin Guillaume. Towards a better insight of RDF triples Ontology-guided Storage system abilities. 6th International Workshop on Scalable Semantic Web Knowledge Base Systems (SSWS'10), 2010, Shanghai, China. 10pp.

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Rizzi Romeo, Vialette Stéphane. A faster algorithm for finding minimum Tucker submatrices. 6th Computability in Europe (CiE'10), 2010, Portugal. Springer, 6158, pp. 69-77, Lecture Notes in Computer Science

  Accès au texte intégral et bibtex

  

  2009

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Sikora Florian, Vialette Stéphane. The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated. Das S. and Uehara R. Proc. 3rd Workshop on Algorithms and Computation (WALCOM 2009), 2009, Kolkata, India. Springer-Verlag, Lecture Notes in Computer Science (LNCS), pp. 357-368, Lecture Notes in Computer Science (LNCS)

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Stoye Jens. Finding Nested Common Intervals Efficiently. Ciccarelli Francesca D. and Miklós István. 7th RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'09), Sep 2009, Budapest, Hungary. Springer-Verlag, 5817, pp. 59-69, Lecture Notes in Bioinformatics

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Sikora Florian, Vialette Stéphane. Querying Protein-Protein Interaction Networks. Mandoiu Ion and Narasimhan Giri and Zhang Yanqing. 5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), May 2009, Fort Lauderdale, United States. Springer-Verlag, 5542, pp. 52-62, LNBI

  Accès au bibtex

  

  2007

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Herry Gaël, Vialette Stéphane. Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS Problems. Sagot Marie-France and Telles Walter Maria Emilia. Brazilian Symposium on Bioinformatics (BSB 2007), Aug 2007, Angra dos Reis, Brazil. Springer-Verlag, Lecture Notes in BioInformatics (LNBI), pp. 101-112, Lecture Notes in BioInformatics (LNBI)

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Rusu Irena, Sinoquet Christine. Extending the Hardness of RNA Secondary Structure Comparison. Chen Bo and Paterson Mike and Zhang Guochuan. 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Apr 2007, Hangzhou, China. Springer-Verlag, 4614, pp. 140-151, Lecture Notes in Computer Science (LNCS)

  Accès au texte intégral et bibtex

  

  2006

  Rèf biblio

  Blin Guillaume, Blais Eric, Guillon Pierre, Blanchette Mathieu, El-Mabrouk Nadia. Inferring Gene Orders from Gene Maps using the Breakpoint Distance. Bourque Guillaume and El-Mabrouk Nadia. 4th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), Sep 2006, Montréal, Canada. Springer-Verlag, 4205, pp. 99-112, LNBI

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Chateau Annie, Chauve Cedric, Gingras Yannick. Inferring Positional Homologs with Common Intervals of Sequences. Bourque Guillaume and El-Mabrouk Nadia. 4th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), Sep 2006, Montreal, Canada. Springer-Verlag, 4205, pp. 24-38, LNBI

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Touzet Helene. How to compare arc-annotated sequences: The alignment hierarchy. Crestani Fabio and Ferragina Paolo and Sanderson Mark. 13th String Processing and Information Retrieval, Oct 2006, Glasgow, United Kingdom. Springer Verlag, 4209, pp. 291-303, Lecture Notes in Computer Sciences

  Accès au texte intégral et bibtex

  

  2005

  Rèf biblio

  Blin Guillaume, Rizzi Roméo. Conserved Interval Distance Computation Between Non-trivial Genomes. Wang Lusheng. 11th Annual International Conference Computing and Combinatorics (COCOON'05), Aug 2005, Kunming, China, China. Springer-Verlag, 3595, pp. 22-31, LNCS

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Rizzi Romeo, Vialette Stéphane. What Makes the Arc-Preserving Subsequence Problem Hard?. S. Sunderam Vaidy and van Albada G. Dick and M. A. Sloot Peter and Dongarra Jack. 5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), May 2005, Atlanta, GA, USA, United States. Springer-Verlag, 3515, pp. 860-868, LNCS

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Chauve Cedric, Fertin Guillaume. Genes Order and Phylogenetic Reconstruction: Application to $\gamma$-Proteobacteria. McLysaght Aoife and H. Huson Daniel. 3rd Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'05), Sep 2005, Dublin, Ireland, Ireland. Springer-Verlag, 3678, pp. 11-20, LNCS

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Hermelin Danny, Vialette Stéphane. Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. Kratsch Dieter. 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Jun 2005, Metz, France, France. Springer-Verlag, 3787, pp. 271-282, LNCS

  Accès au texte intégral et bibtex

  

  2004

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Rizzi Roméo, Vialette Stéphane. Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem. 5th Journées Ouvertes de Biologie, Informatique et Mathématiques (JOBIM'04), 2004, Montréal, Quebec, Canada. IEEE Computer Society, 12 pp.

  Accès au bibtex

  

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Chauve Cedric. The breakpoint distance for signed sequences. 1st Conference on Algorithms and Computational Methods for biochemical and Evolutionary Networks (CompBioNets'04), Dec 2004, Recife, Brazil, Brazil. King's College London publications, 3, pp. 3-16, Texts in Algorithms

  Accès au texte intégral et bibtex

  

  Rèf biblio

  Blin Guillaume, Fertin Guillaume, Vialette Stéphane. New Results for the 2-Interval Pattern Problem. Sahinalp Suleyman Cenk and Muthukrishnan S. and Dogrusoz Ugur. 15th Symposium on Combinatorial Pattern Matching (CPM'04), Jul 2004, Istanbul, Turkey, Turkey. Springer-Verlag, 3109, pp. 311-322, LNCS

  Accès au texte intégral et bibtex

  

  Phd Thesis +/-

  Thèses

  2005

  Rèf biblio

  Blin Guillaume. Combinatoire and Bio-informatique : Comparaison de structures d'ARN et calcul de distances intergénomiques. Université de Nantes, Nov. 2005. French

  Accès au texte intégral et bibtex

  

  Other +/-

  Communications sans actes

  2009

  Rèf biblio

  Blin Guillaume, Crochemore Maxime, Hamel Sylvie, Vialette Stéphane. Finding the median of three permutations under the Kendall-tau distance. 7th annual international conference on Permutation Patterns, Jul 2009, Firenze, Italy.

  Accès au bibtex

  

  Preprint, Working Paper, Document sans référence, etc.

  2008

  Rèf biblio

  Blin Guillaume, Hamel Sylvie, Vialette Stéphane. Comparing RNA structures using a full set of biologically relevant edit operations is intractable. Dec. 2008. 7 pages

  Accès au texte intégral et bibtex