Guillaume Blin

Laboratoire d'informatique Gaspard-Monge

UMR 8049 LIGM

 
  Bureau 4B066 -- Cité Descartes, Bât Copernic -- 5, bd Descartes
Champs sur Marne 77454 Marne-la-Vallée Cedex 2   		  +33.1.60.95.77.49
+33.1.60.95.75.57
 
 
> Home
> Teaching
> Research
  + Publications
  + Projects & Collaborators
  + Talks
  + Administrative stuff
 > Interesting conferences
> Me, Myself & I












  > Home > Publications

Publications

Per Type

All my publications in BibTex format

Book Chapter

  1. [bib] Guillaume Blin, Maxime Crochemore, and Stéphane Vialette. Algorithmic Aspects of Arc-Annotated Sequences. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications. Wiley.  2009. 

Journals

  1. [bib] Guillaume Blin, Florian Sikora, and Stéphane Vialette. Querying Graphs in Protein-Protein Interactions Networks using Feedback Vertex Set. IEEE/ACM Transactions on Computational Biology and Bioinformatics.  2010.  Note: Special Issue-ISBRA 2009-Bioinformatics Research and Applications To appear 

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

  3. [bib] Guillaume Blin, Alain Denise, Serge Dulucq, Claire Herrbach, and Hélène Touzet. Alignment of RNA structures. IEEE/ACM Transactions on Computational Biology and Bioinformatics.  2008.  Note: To appear 

  4. [bib] Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, and Stéphane Vialette. Comparing genomes with duplications: a computational complexity point of view. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 4 (4).  October  2007.  pp. 523–534. 

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

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

  7. [bib] Guillaume Blin, Guillaume Fertin, Romeo Rizzi, and Stéphane Vialette. What Makes the Arc-Preserving Subsequence Problem Hard?. Transactions on Computational Systems Biology II. vol. 3680.  2005.  pp. 1–36. 

Inproceeding

  1. [bib] Guillaume Blin, Florian Sikora, and Stéphane Vialette. GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks. 2nd International Conference on Bioinformatics and Computational Biology (BICoB'10). International Society for Computers and their Applications (ISCA).   24-26 March  2010.  Note: To appear hal-00425661 

  2. [bib] Guillaume Blin, Sylvie Hamel, and Stéphane Vialette. Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions.  In Md. S. Rahman, S. Fujita, editors, 4th Workshop on Algorithms and Computation (WALCOM'10).  vol. 5942.  Lecture Notes in Computer Science.   Dhaka, Bangladesh.   10-12 February  2010.  pp. 149–160. Springer-Verlag.   Note: arXiv:0812.3946 

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

  4. [bib] Guillaume Blin, Florian Sikora, and Stéphane Vialette. Querying Protein-Protein Interaction Networks.  In S Istrail, P Pevzner, M. Waterman, editors, 5th International Symposium on Bioinformatics Research and Applications (ISBRA'09).  vol. 5542.  LNBI.   Fort Lauderdale, FL, USA.   13-16 May  2009.  pp. 52–62. Springer-Verlag. 

  5. [bib] Guillaume Blin, Guillaume Fertin, Florian Sikora, and Stéphane Vialette. The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated.  In S. Das, R. Uehara, editors, 3rd Annual Workshop on Algorithms and Computation (WALCOM'09).  vol. 5431.  LNCS.   Kolkata, India.   18-20 February  2009.  pp. 357–368. Springer-Verlag. 

  6. [bib] Guillaume Blin, Guillaume Fertin, Gaël Herry, and Stéphane Vialette. Comparing RNA structures: towards an intermediate model between the EDIT and the LAPCS problems.  In Marie-France Sagot, Maria Emilia Telles Walter, editors, 1st Brazilian Symposium on Bioinformatics (BSB'07).  vol. 4643.  Lecture Notes in Bioinformatics.   Angra dos Reis, Brazil.  August  2007.  pp. 101–112. Springer-Verlag. 

  7. [bib] Guillaume Blin, Guillaume Fertin, Irena Rusu, and Christine Sinoquet. Extending the Hardness of RNA Secondary Structure Comparison.  In Bo Chen, Mike Paterson, Guochuan Zhang, editors, 1st intErnational Symposium on Combinatorics, Algorithms, Probabilistic and Experimental methodologies (ESCAPE'07).  vol. 4614.  LNCS.   Hangzhou, China.  April  2007.  pp. 140–151. Springer-Verlag. 

  8. [bib] Guillaume Blin and Hélène Touzet. How to Compare Arc-Annotated Sequences: The Alignment Hierarchy.  In Fabio Crestani, Paolo Ferragina, Mark Sanderson, editors, 13th String Processing and Information Retrieval (SPIRE'06).  vol. 4209.  LNCS.   Glasgow, UK.  October  2006.  pp. 291–303. Springer-Verlag. 

  9. [bib] Guillaume Blin, Eric Blais, Pierre Guillon, Mathieu Blanchette, and Nadia El-Mabrouk. Inferring Gene Orders from Gene Maps using the Breakpoint Distance.  In Guillaume Bourque, Nadia El-Mabrouk, editors, 4th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06).  vol. 4205.  LNBI.   Montréal, Quebec.   24-26 September  2006.  pp. 99–112. Springer-Verlag. 

  10. [bib] Guillaume Blin, Annie Chateau, Cedric Chauve, and Yannick Gingras. Inferring Positional Homologs with Common Intervals of Sequences.  In Guillaume Bourque, Nadia El-Mabrouk, editors, 4th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06).  vol. 4205.  LNBI.   Montreal,Quebec.  September  2006.  pp. 24–38. Springer-Verlag. 

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

  12. [bib] Guillaume Blin and Roméo Rizzi. Conserved Interval Distance Computation Between Non-trivial.  In Lusheng Wang, editors, 11th Annual International Conference Computing and Combinatorics (COCOON'05).  vol. 3595.  LNCS.   Kunming, China.  August  2005.  pp. 22–31. Springer-Verlag. 

  13. [bib] Guillaume Blin, Guillaume Fertin, Danny Hermelin, and Stéphane Vialette. Fixed-Parameter Algorithms for Protein Similarity Search.  In Dieter Kratsch, editors, 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05).  vol. 3787.  LNCS.   Metz, France.  June  2005.  pp. 271–282. Springer-Verlag. 

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

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

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

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

Phd Thesis

  1. [bib] Guillaume Blin. Combinatoire and Bio-informatique : Comparaison de structures d'ARN et calcul de distances intergénomiques. Thèse de doctorat. Université de Nantes.  2005.  Jury: Irena Rusu, Guillaume Fertin, Marie-France Sagot, Hélène Touzet, Roméo Rizzi, Stéphane Vialette, (168 pp.).

Other

  1. [bib] Guillaume Blin, David Faye, and Jens Stoye. Finding Nested Common Intervals Efficiently. Université Paris Est, I.G.M..  December  2009. http://hal.archives-ouvertes.fr/hal-00441160/fr/ Note: electronic version (24 pp.) Preprint hal-00441160 

  2. [bib] Guillaume Blin, Guillaume Fertin, Irena Rusu, and Christine Sinoquet. RNA Sequences and the EDIT(NESTED,NESTED) problem. Institut de Recherche en Informatique de Nantes. RR-IRIN-03.07.  July  2003. 
Guillaume Blin -- 2010