New Results for the 2-Interval Pattern Problem. - Guillaume Blin; Guillaume Fertin; Stéphane Vialette (CPM, 2004)

Conserved Interval Distance Computation Between Non-trivial Genomes. - Guillaume Blin; Romeo Rizzi (COCOON, 2005)

Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria. - Guillaume Blin; Cédric Chauve; Guillaume Fertin (Comparative Genomics, 2005)

What Makes the Arc-Preserving Subsequence Problem Hard? - Guillaume Blin; Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (Trans. Comp. Sys. Biology, 2005)

Combinatoire and Bio-informatique : Comparaison de structures d'ARN et calcul de distances intergénomiques. (Combinatorics and Bioinformatic : RNA structure comparison and intergenomic distance computation). - Guillaume Blin (2005)

Inferring Gene Orders from Gene Maps Using the Breakpoint Distance. - Guillaume Blin; Eric Blais; Pierre Guillon 001; Mathieu Blanchette; Nadia El-Mabrouk (Comparative Genomics, 2006)

Inferring Positional Homologs with Common Intervals of Sequences. - Guillaume Blin; Annie Chateau; Cédric Chauve; Yannick Gingras (Comparative Genomics, 2006)

How to Compare Arc-Annotated Sequences: The Alignment Hierarchy. - Guillaume Blin; Hélène Touzet (SPIRE, 2006)

Extending the Hardness of RNA Secondary Structure Comparison. - Guillaume Blin; Guillaume Fertin; Irena Rusu; Christine Sinoquet (ESCAPE, 2007)

Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. - Guillaume Blin; Guillaume Fertin; Gaël Herry; Stéphane Vialette (BSB, 2007)

Gene Maps Linearization Using Genomic Rearrangement Distances. - Guillaume Blin; Eric Blais; Danny Hermelin; Pierre Guillon 001; Mathieu Blanchette; Nadia El-Mabrouk (J. Comput. Biol., 2007)

Comparing Genomes with Duplications: A Computational Complexity Point of View. - Guillaume Blin; Cédric Chauve; Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

Extracting constrained 2-interval subsets in 2-interval sets. - Guillaume Blin; Guillaume Fertin; Stéphane Vialette (Theor. Comput. Sci., 2007)

Comparing RNA structures using a full set of biologically relevant edit operations is intractable - Guillaume Blin; Sylvie Hamel; Stéphane Vialette (CoRR, 2008)

Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. - Guillaume Blin; Guillaume Fertin; Danny Hermelin; Stéphane Vialette (J. Discrete Algorithms, 2008)

Querying Protein-Protein Interaction Networks. - Guillaume Blin; Florian Sikora; Stéphane Vialette (ISBRA, 2009)

Finding Nested Common Intervals Efficiently. - Guillaume Blin; Jens Stoye (RECOMB-CG, 2009)

The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. - Guillaume Blin; Guillaume Fertin; Florian Sikora; Stéphane Vialette (WALCOM, 2009)

GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks. - Guillaume Blin; Florian Sikora; Stéphane Vialette (BICoB, 2010)

Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. - Guillaume Blin; Sylvie Hamel; Stéphane Vialette (WALCOM, 2010)

Finding Nested Common Intervals Efficiently. - Guillaume Blin; David C. Faye; Jens Stoye (J. Comput. Biol., 2010)

Alignments of RNA Structures. - Guillaume Blin; Alain Denise; Serge Dulucq; Claire Herrbach; Hélène Touzet (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set. - Guillaume Blin; Florian Sikora; Stéphane Vialette (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

Algorithmic Aspects of Heterogeneous Biological Networks Comparison. - Guillaume Blin; Guillaume Fertin; Hafedh Mohamed-Babou; Irena Rusu; Florian Sikora; Stéphane Vialette (COCOA, 2011)

A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. - Guillaume Blin; Romeo Rizzi; Stéphane Vialette (CSR, 2011)

RDF triples management in roStore. - David C. Faye; Olivier Curé; Guillaume Blin; Cheikh Thiam (IC, 2011)

Combinatorial Objects in Bio-Algorithmics: Related problems and complexities. - Guillaume Blin (2012)

Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. - Guillaume Blin; Laurent Bulteau; Minghui Jiang 001; Pedro J. Tejada; Stéphane Vialette (CPM, 2012)

The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. - Guillaume Blin; Minghui Jiang 001; Stéphane Vialette (SPIRE, 2012)

An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval. - Xiao Yang; Florian Sikora; Guillaume Blin; Sylvie Hamel; Romeo Rizzi; Srinivas Aluru (TAMC, 2012)

A survey of RDF storage approaches. - David Célestin Faye; Olivier Curé; Guillaume Blin (ARIMA J., 2012)

On the parameterized complexity of the repetition free longest common subsequence problem. - Guillaume Blin; Paola Bonizzoni; Riccardo Dondi; Florian Sikora (Inf. Process. Lett., 2012)

A Faster Algorithm for Finding Minimum Tucker Submatrices. - Guillaume Blin; Romeo Rizzi; Stéphane Vialette (Theory Comput. Syst., 2012)

Towards a better insight of RDF triples Ontology-guided Storage system abilities. - Olivier Curé; David C. Faye; Guillaume Blin (CoRR, 2013)

Minimum Mosaic Inference of a Set of Recombinants. - Guillaume Blin; Romeo Rizzi; Florian Sikora; Stéphane Vialette (Int. J. Found. Comput. Sci., 2013)

WaterFowl: A Compact, Self-indexed and Inference-Enabled Immutable RDF Store. - Olivier Curé; Guillaume Blin; Dominique Revuz; David Célestin Faye (ESWC, 2014)

Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. - Anna Adamaszek; Guillaume Blin; Alexandru Popa 001 (IWOCA, 2014)

An update strategy for the WaterFowl RDF data store. - Olivier Curé; Guillaume Blin (ISWC (Posters & Demos), 2014)

Towards Unlocking the Full Potential of Multileaf Collimators. - Guillaume Blin; Paul Morel; Romeo Rizzi; Stéphane Vialette (SOFSEM, 2014)

WaterFowl, a Compact, Self-indexed RDF Store with Inference-enabled Dictionaries. - Olivier Curé; Guillaume Blin; Dominique Revuz; David C. Faye (CoRR, 2014)

Complexity insights of the Minimum Duplication problem. - Guillaume Blin; Paola Bonizzoni; Riccardo Dondi; Romeo Rizzi; Florian Sikora (Theor. Comput. Sci., 2014)

RDF Database Systems: Triples Storage and SPARQL Query Processing - Olivier Curé; Guillaume Blin (Morgan Kaufmann, 2015)

Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem. - Thomas Hume; Hayssam Soueidan; Macha Nikolski; Guillaume Blin (SOFSEM, 2015)

xHeinz: an algorithm for mining cross-species network modules under a flexible conservation model. - Mohammed El-Kebir; Hayssam Soueidan; Thomas Hume; Daniela Beisser; Marcus T. Dittrich; Tobias Müller 001; Guillaume Blin; Jaap Heringa; Macha Nikolski; Lodewyk F. A. Wessels; Gunnar W. Klau (Bioinform., 2015)

Rank aggregation with ties: Experiments and Analysis. - Bryan Brancotte; Bo Yang 030; Guillaume Blin; Sarah Cohen Boulakia; Alain Denise; Sylvie Hamel (Proc. VLDB Endow., 2015)

SOBRA - Shielding Optimization for BRAchytherapy. - Guillaume Blin; Marie Gasparoux; Sebastian Ordyniak; Alexandru Popa 001 (IWOCA, 2016)

Agent-Based Modelling of Pattern Formation in Pluripotent Stem Cells: Initial Experiments and Results. - Minhong Wang 002; David Robertson 001; Guillaume Blin; Sally Lowell; Thanasis Tsanas (CISP-BMEI, 2018)

Nearest constrained circular words. - Guillaume Blin; Alexandre Blondin Massé; Marie Gasparoux; Sylvie Hamel; Élise Vandomme (CPM, 2018)

Investigating Motility and Pattern Formation in Pluripotent Stem Cells Through Agent-Based Modeling. - Minhong Wang 002; Athanasios Tsanas; Guillaume Blin; Dave Robertson 001 (BIBE, 2019)

Assessing Preferred Proximity Between Different Types of Embryonic Stem Cells. - Minhong Wang 002; Athanasios Tsanas; Guillaume Blin; Dave Robertson 001 (BIOSIGNALS, 2020)

On the Approximability of the Minimum Weight $t$-partite Clique Problem. - Geoffrey Solano; Guillaume Blin; Mathieu Raffinot; Jhoirene B. Clemente; Jaime Caro (J. Graph Algorithms Appl., 2020)

Enabling Biomedical Semantic Knowledge Resource's Paths with the K-Ware Platform. - Bruno Thiao-Layel; Vianney Jouhet; Guillaume Blin; Gayo Diallo (ICHI, 2022)

REDIRECT: Mapping Drug Prescriptions and Evidence from Biomedical Literature. - Bruno Thiao-Layel; Vianney Jouhet; Guillaume Blin; Gayo Diallo (MIE, 2022)

Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. - Guillaume Blin; Alexandru Popa 001; Mathieu Raffinot; Raluca Uricaru (SPIRE, 2023)

Graph neural network comparison for 2D nesting efficiency estimation. - Corentin Lallier; Guillaume Blin; Bruno Pinaud; Laurent Vézard (J. Intell. Manuf., 2024)