Search the dblp DataBase

Publications of Author

1. Guillaume Blin, Romeo Rizzi
   Conserved Interval Distance Computation Between Non-trivial Genomes. [Citation Graph (0, 0)][DBLP]
   COCOON, 2005, pp:22-31 [Conf]
   
2. Guillaume Blin, Guillaume Fertin, Stéphane Vialette
   New Results for the 2-Interval Pattern Problem. [Citation Graph (0, 0)][DBLP]
   CPM, 2004, pp:311-322 [Conf]
   
3. Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
   What Makes the Arc-Preserving Subsequence Problem Hard? [Citation Graph (0, 0)][DBLP]
   International Conference on Computational Science (2), 2005, pp:860-868 [Conf]
   
4. Guillaume Blin, Eric Blais, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk
   Inferring Gene Orders from Gene Maps Using the Breakpoint Distance. [Citation Graph (0, 0)][DBLP]
   Comparative Genomics, 2006, pp:99-112 [Conf]
   
5. Guillaume Blin, Annie Chateau, Cedric Chauve, Yannick Gingras
   Inferring Positional Homologs with Common Intervals of Sequences. [Citation Graph (0, 0)][DBLP]
   Comparative Genomics, 2006, pp:24-38 [Conf]
   
6. Guillaume Blin, Cedric Chauve, Guillaume Fertin
   Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria. [Citation Graph (0, 0)][DBLP]
   Comparative Genomics, 2005, pp:11-20 [Conf]
   
7. Guillaume Blin, Hélène Touzet
   How to Compare Arc-Annotated Sequences: The Alignment Hierarchy. [Citation Graph (0, 0)][DBLP]
   SPIRE, 2006, pp:291-303 [Conf]
   
8. Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
   Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. [Citation Graph (0, 0)][DBLP]
   WG, 2005, pp:271-282 [Conf]
   
9. Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
   What Makes the Arc-Preserving Subsequence Problem Hard? [Citation Graph (0, 0)][DBLP]
   T. Comp. Sys. Biology, 2005, v:2, n:, pp:1-36 [Journal]
   
10. Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette
    Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. [Citation Graph (0, 0)][DBLP]
    BSB, 2007, pp:101-112 [Conf]
    
11. Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet
    Extending the Hardness of RNA Secondary Structure Comparison. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:140-151 [Conf]
    
12. Guillaume Blin, Guillaume Fertin, Stéphane Vialette
    Extracting constrained 2-interval subsets in 2-interval sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:241-263 [Journal]
    
13. 
    A Faster Algorithm for Finding Minimum Tucker Submatrices. [Citation Graph (, )][DBLP]
    
    
14. 
    Finding Nested Common Intervals Efficiently. [Citation Graph (, )][DBLP]
    
    
15. 
    Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. [Citation Graph (, )][DBLP]
    
    
16. 
    The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. [Citation Graph (, )][DBLP]
    
    
17. 
    Querying Protein-Protein Interaction Networks. [Citation Graph (, )][DBLP]
    
    
18. 
    GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks. [Citation Graph (, )][DBLP]
    
    
19. 
    Comparing RNA structures using a full set of biologically relevant edit operations is intractable [Citation Graph (, )][DBLP]