Guillaume Blin Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2012
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora: On the parameterized complexity of the repetition free longest common subsequence problem. Inf. Process. Lett. 112(7): 272-276 (2012)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Romeo Rizzi, Stéphane Vialette: A Faster Algorithm for Finding Minimum Tucker Submatrices. Theory Comput. Syst. 51(3): 270-281 (2012)
c23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette: Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. CPM 2012: 138-148
c22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora: Complexity Insights of the Minimum Duplication Problem. SOFSEM 2012: 153-164
c21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Minghui Jiang, Stéphane Vialette: The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. SPIRE 2012: 130-142
c20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Romeo Rizzi, Srinivas Aluru: An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. TAMC 2012: 319-329
2011
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette: Minimum Mosaic Inference of a Set of Recombinants. CATS 2011: 23-30
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette: Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA 2011: 272-286
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Romeo Rizzi, Stéphane Vialette: A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. CSR 2011: 373-384
2010
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, David Faye, Jens Stoye: Finding Nested Common Intervals Efficiently. Journal of Computational Biology 17(9): 1183-1194 (2010)
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Alain Denise, Serge Dulucq, Claire Herrbach, Hélène Touzet: Alignments of RNA Structures. IEEE/ACM Trans. Comput. Biology Bioinform. 7(2): 309-322 (2010)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Florian Sikora, Stéphane Vialette: Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set. IEEE/ACM Trans. Comput. Biology Bioinform. 7(4): 628-635 (2010)
c16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Florian Sikora, Stéphane Vialette: GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks. BICoB 2010: 38-43
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Romeo Rizzi, Stéphane Vialette: A Faster Algorithm for Finding Minimum Tucker Submatrices. CiE 2010: 69-77
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Sylvie Hamel, Stéphane Vialette: Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. WALCOM 2010: 149-160
2009
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Florian Sikora, Stéphane Vialette: Querying Protein-Protein Interaction Networks. ISBRA 2009: 52-62
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Jens Stoye: Finding Nested Common Intervals Efficiently. RECOMB-CG 2009: 59-69
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette: The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM 2009: 357-368
2008
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms 6(4): 618-626 (2008)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Sylvie Hamel, Stéphane Vialette: Comparing RNA structures using a full set of biologically relevant edit operations is intractable. CoRR abs/0812.3946 (2008)
2007
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Eric Blais, Danny Hermelin, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk: Gene Maps Linearization Using Genomic Rearrangement Distances. Journal of Computational Biology 14(4): 394-407 (2007)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: Comparing Genomes with Duplications: A Computational Complexity Point of View. IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 523-534 (2007)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Guillaume Fertin, Stéphane Vialette: Extracting constrained 2-interval subsets in 2-interval sets. Theor. Comput. Sci. 385(1-3): 241-263 (2007)
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet: Extending the Hardness of RNA Secondary Structure Comparison. ESCAPE 2007: 140-151
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette: Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. BSB 2007: 101-112
2006
c8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Annie Chateau, Cedric Chauve, Yannick Gingras: Inferring Positional Homologs with Common Intervals of Sequences. Comparative Genomics 2006: 24-38
c7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Eric Blais, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk: Inferring Gene Orders from Gene Maps Using the Breakpoint Distance. Comparative Genomics 2006: 99-112
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Hélène Touzet: How to Compare Arc-Annotated Sequences: The Alignment Hierarchy. SPIRE 2006: 291-303
2005
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: What Makes the Arc-Preserving Subsequence Problem Hard? T. Comp. Sys. Biology 2: 1-36 (2005)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Romeo Rizzi: Conserved Interval Distance Computation Between Non-trivial Genomes. COCOON 2005: 22-31
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette: What Makes the Arc-Preserving Subsequence Problem Hard? International Conference on Computational Science (2) 2005: 860-868
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Cedric Chauve, Guillaume Fertin: Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria. Comparative Genomics 2005: 11-20
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette: Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG 2005: 271-282
2004
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Guillaume Blin, Guillaume Fertin, Stéphane Vialette: New Results for the 2-Interval Pattern Problem. CPM 2004: 311-322

Coauthor Index

1Srinivas Aluru
[c20]
2Eric Blais
[j4] [c7]
3Mathieu Blanchette
[j4] [c7]
4Paola Bonizzoni
[j10] [c22]
5Laurent Bulteau
[c23]
6Annie Chateau
[c8]
7Cedric Chauve
[j3] [c8] [c3]
8Alain Denise
[j7]
9Riccardo Dondi
[j10] [c22]
10Serge Dulucq
[j7]
11Nadia El-Mabrouk
[j4] [c7]
12David Faye
[j8]
13Guillaume Fertin
[c18] [c11] [j5] [j3] [j2] [c10] [c9] [j1] [c4] [c3] [c2] [c1]
14Yannick Gingras
[c8]
15Pierre Guillon
[j4] [c7]
16Sylvie Hamel
[c20] [c14] [i1]
17Danny Hermelin
[j5] [j4] [c2]
18Claire Herrbach
[j7]
19Gaël Herry
[c9]
20Minghui Jiang
[c23] [c21]
21Hafedh Mohamed-Babou
[c18]
22Romeo Rizzi
[j9] [c22] [c20] [c19] [c17] [c15] [j3] [j1] [c5] [c4]
23Irena Rusu
[c18] [c10]
24Florian Sikora
[j10] [c22] [c20] [c19] [c18] [j6] [c16] [c13] [c11]
25Christine Sinoquet
[c10]
26Jens Stoye
[j8] [c12]
27Pedro J. Tejada
[c23]
28Hélène Touzet
[j7] [c6]
29Stéphane Vialette
[j9] [c23] [c21] [c19] [c18] [c17] [j6] [c16] [c15] [c14] [c13] [c11] [j5] [i1] [j3] [j2] [c9] [j1] [c4] [c2] [c1]
30Xiao Yang
[c20]

Colors in the list of coauthors

Last update Wed May 22 16:17:48 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page