The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stéphane Vialette: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Walen
    Approximation of RNA Multiple Structural Alignment. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:211-222 [Conf]
  3. Stéphane Vialette
    Pattern Matching Problems over 2-Interval Sets. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:53-63 [Conf]
  4. Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette
    Approximating the 2-Interval Pattern Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:426-437 [Conf]
  5. 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]
  6. Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
    Exemplar Longest Common Subsequence. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:622-629 [Conf]
  7. Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
    Genomes Containing Duplicates Are Hard to Compare. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:783-790 [Conf]
  8. Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
    Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:328-339 [Conf]
  9. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
    How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. [Citation Graph (0, 0)][DBLP]
    Comparative Genomics, 2006, pp:75-86 [Conf]
  10. 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]
  11. Gaëlle Lelandais, Pierre Vincens, Anne Badel-Chagnon, Stéphane Vialette, Claude Jacq, Serge A. Hazout
    Comparing gene expression networks in a multi-dimensional space to extract similarities and differences between organisms. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:11, pp:1359-1366 [Journal]
  12. Gaëlle Lelandais, Philippe Marc, Pierre Vincens, Claude Jacq, Stéphane Vialette
    MiCoViTo: a tool for gene-centric comparison and visualization of yeast transcriptome states. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2004, v:5, n:, pp:20- [Journal]
  13. Gaëlle Lelandais, Stéphane Le Crom, Frédéric Devaux, Stéphane Vialette, George M. Church, Claude Jacq, Philippe Marc
    yMGV: a cross-species expression data mining tool. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 2004, v:32, n:Database-Issue, pp:323-325 [Journal]
  14. Stéphane Vialette
    On the computational complexity of 2-interval pattern matching problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:2-3, pp:223-249 [Journal]
  15. 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]
  16. Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
    Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:241-252 [Conf]
  17. Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
    Longest Common Separable Pattern Among Permutations. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:316-327 [Conf]
  18. Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette
    Pattern Matching in Protein-Protein Interaction Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:137-148 [Conf]
  19. Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
    Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:340-351 [Conf]
  20. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
    A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. [Citation Graph (0, 0)][DBLP]
    RECOMB-CG, 2007, pp:16-29 [Conf]
  21. 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]
  22. Mathilde Bouvel, Dominique Rossin, Stéphane Vialette
    Longest Common Separable Pattern between Permutations [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  23. Philippe Gambette, Stéphane Vialette
    On restrictions of balanced 2-interval graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  24. 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]

  25. A Faster Algorithm for Finding Minimum Tucker Submatrices. [Citation Graph (, )][DBLP]


  26. On Finding Small 2-Generating Sets. [Citation Graph (, )][DBLP]


  27. Maximum Motif Problem in Vertex-Colored Graphs. [Citation Graph (, )][DBLP]


  28. Weak pattern matching in colored graphs: Minimizing the number of connected components. [Citation Graph (, )][DBLP]


  29. Pattern Matching for 321-Avoiding Permutations. [Citation Graph (, )][DBLP]


  30. Pseudo Boolean Programming for Partially Ordered Genomes. [Citation Graph (, )][DBLP]


  31. The Minimum Substring Cover Problem. [Citation Graph (, )][DBLP]


  32. On Restrictions of Balanced 2-Interval Graphs. [Citation Graph (, )][DBLP]


  33. Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. [Citation Graph (, )][DBLP]


  34. The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. [Citation Graph (, )][DBLP]


  35. Querying Protein-Protein Interaction Networks. [Citation Graph (, )][DBLP]


  36. GraMoFoNe: a Cytoscape Plugin for Querying Motifs without Topology in Protein-Protein Interactions Networks. [Citation Graph (, )][DBLP]


  37. On the Approximability of Comparing Genomes with Duplicates [Citation Graph (, )][DBLP]


  38. Comparing RNA structures using a full set of biologically relevant edit operations is intractable [Citation Graph (, )][DBLP]


Search in 0.394secs, Finished in 0.396secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002