Few words
Few words :: Recent Publications
|
||||
Welcome to my webpage. I’m currently an Associate Professor in the LIGM of Marne-la-Vallée University in FRANCE.
You will find here an up to date CV.
I was one of the organizer of the general seminar of the « Laboratoire d'Informatique Gaspard Monge » from 2006 until 2010. To propose your participation to this last please send an e-mail at this encrypted address.
I am also a member of the LIRCO.
The June 18th 2012, i've defended my habilitation on the following topic : "Combinatorial Objects in Bio-Algorithmics: Related problems and complexities" in front of the following jury:
- Maxime Crochemore, Professor at Université de Marne-la-vallée (France)
- Thierry Lecroq, Professor at Université de Rouen (France)
- Bernard Moret, Professor at EPFL (Switzerland)
- Eric Rivals, Professor at Université de Montpellier (France)
- Marie-France Sagot, Professor at Université Claude Bernard (France)
- Laurent Vuillon, Professor at Université de Savoie (France)
From October 2002 to November 2005, i’ve been preparing a thesis in Bio-informatic on the following topic : "Combinatoire and Bio-informatique : Comparaison de structures d’ARN et calcul de distances intergénomiques.".
I’ve defended this thesis the 17th of November 2005 in front of the following jury :
- Guillaume Fertin, Professor at Université de Nantes (France)
- Marie-France Sagot, CNRS Research Director at INRIA Rhônes-Alpes (France)
- Hélène Touzet, CNRS Researcher (DR2) at Université de Lille (France)
- Roméo Rizzi, Professor at Università degli Studi di Trento (Italy)
- Irena Rusu, Professor at Université de Nantes (France)
- Stéphane Vialette, CNRS Researcher (CR1) at Université Paris-Est MLV (France)
Recent papers
- Check out my full publications list here.
- My five last publications
Publications HAL de blin de la collection CV_LIGM - Rèf biblio
- Guillaume Blin, Minghui Jiang, Stéphane Vialette. The longest common subsequence problem with crossing-free arc-annotated sequences. L. Calderon-Benavides et al.. 19th edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2012), Oct 2012, Cartagena de Indias, Colombia. Springer, Heidelberg, 7608, pp. 130-142, LNCS
- Accès au texte intégral et bibtex
-
- Rèf biblio
- Guillaume Blin, Laurent Bulteau, Minghui Jiang, Tejada Pedro J., Stéphane Vialette. 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
- Guillaume Blin. Combinatorial Objects in Bio-Algorithmics: Related problems and complexities. Université Paris-Est, Jun. 2012. English
- Accès au texte intégral et bibtex
-
- Rèf biblio
- Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Roméo Rizzi, Srinivas Aluru. 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
- Guillaume Blin, Romeo Rizzi, Stéphane Vialette. A faster algorithm for finding minimum Tucker submatrices. Theory of Computing Systems, 2012, 51 (3), pp. 270-281. <http://dx.doi.org/10.1007/s00224-012-9388-1>
- Accès au texte intégral et bibtex
-