The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marie-France Sagot: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexandra M. Carvalho, Ana T. Freitas, Arlindo L. Oliveira, Marie-France Sagot
    A highly scalable algorithm for the extraction of CIS-regulatory regions. [Citation Graph (0, 0)][DBLP]
    APBC, 2005, pp:273-282 [Conf]
  2. Marie-France Sagot, Eric Tannier
    Perfect Sorting by Reversals. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:42-51 [Conf]
  3. Marie-France Sagot, Alain Viari
    A Double Combinatorial Approach to Discovering Patterns in Biological Sequences. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:186-208 [Conf]
  4. Marie-France Sagot, Alain Viari
    Flexible Identification of Structural Objects in Nucleic Acid Sequences: Palindromes, Mirror Repeats, Pseudoknots and Triple Helices. [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:224-246 [Conf]
  5. Marie-France Sagot, Alain Viari, Henry Soldano
    Multiple Sequence Comparison: A Peptide Matching Approach. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:366-385 [Conf]
  6. Eric Tannier, Marie-France Sagot
    Sorting by Reversals in Subquadratic Time. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:1-13 [Conf]
  7. Marie-France Sagot, Alain Viari, Henry Soldano
    A Distance-Based Block Searching Algorithm. [Citation Graph (0, 0)][DBLP]
    ISMB, 1995, pp:322-331 [Conf]
  8. Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2005, pp:167-174 [Conf]
  9. Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    Longest Repeats with a Block of Don't Cares. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:271-278 [Conf]
  10. Nadia Pisanti, Alexandra M. Carvalho, Laurent Marsan, Marie-France Sagot
    RISOTTO: Fast Extraction of Motifs with Mismatches. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:757-768 [Conf]
  11. Marie-France Sagot
    Spelling Approximate Repeated or Common Motifs Using a Suffix Tree. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:374-390 [Conf]
  12. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
    A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:622-631 [Conf]
  13. Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi
    Some Approximation Results for the Maximum Agreement Forest Problem. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:159-169 [Conf]
  14. Laurent Marsan, Marie-France Sagot
    Extracting structured motifs using a suffix tree - algorithms and application to promoter consensus identification. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2000, pp:210-219 [Conf]
  15. Marie-France Sagot, Eugene W. Myers
    Identifying satellites in nucleic acid sequences. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1998, pp:234-242 [Conf]
  16. Alexandra M. Carvalho, Arlindo L. Oliveira, Ana T. Freitas, Marie-France Sagot
    A parallel algorithm for the extraction of structured motifs. [Citation Graph (0, 0)][DBLP]
    SAC, 2004, pp:147-153 [Conf]
  17. Julien Allali, Marie-France Sagot
    A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:348-359 [Conf]
  18. Maxime Crochemore, Raffaele Giancarlo, Marie-France Sagot
    Longest Motifs with a Functionally Equivalent Central Block. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:298-209 [Conf]
  19. Alexandra M. Carvalho, Ana T. Freitas, Arlindo L. Oliveira, Marie-France Sagot
    Efficient Extraction of Structured Motifs Using Box-Links. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:267-268 [Conf]
  20. Pierre Peterlongo, Nadia Pisanti, Frédéric Boyer, Marie-France Sagot
    Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:179-190 [Conf]
  21. Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot
    A First Approach to Finding Common Motifs With Gaps. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:88-97 [Conf]
  22. Pierre Peterlongo, Julien Allali, Marie-France Sagot
    The gapped-factor tree. [Citation Graph (0, 0)][DBLP]
    Stringology, 2006, pp:182-196 [Conf]
  23. Julien Allali, Marie-France Sagot
    Novel Tree Edit Operations for RNA Secondary Structure Comparison. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:412-425 [Conf]
  24. Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot
    Reaction Motifs in Metabolic Networks. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:178-191 [Conf]
  25. Nadia Pisanti, Marie-France Sagot
    Further Thoughts on the Syntenic Distance between Genomes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:2, pp:157-180 [Journal]
  26. Marie-France Sagot, Alain Viari, Joël Pothier, Henry Soldano
    Finding flexible patterns in a text: an application to three-dimensional molecular matching. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1995, v:11, n:1, pp:59-70 [Journal]
  27. Eric Tannier, Anne Bergeron, Marie-France Sagot
    Advances on sorting by reversals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:881-888 [Journal]
  28. Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot
    A first approach to finding common motifs with gaps. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1145-1154 [Journal]
  29. Laurent Marsan, Marie-France Sagot
    Algorithms for Extracting Structured Motifs Using a Suffix Tree with an Application to Promoter and Regulatory Site Consensus Identification. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2000, v:7, n:3-4, pp:345-362 [Journal]
  30. Stéphane Robin, Jean-Jacques Daudin, Hugues Richard, Marie-France Sagot, Sophie Schbath
    Occurrence Probability of Structured Motifs in Random Sequences. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2002, v:9, n:6, pp:761-774 [Journal]
  31. Marie-France Sagot, Eugene W. Myers
    Identifying Satellites and Periodic Repetitions in Biological Sequences. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1998, v:5, n:3, pp:539-554 [Journal]
  32. Julien Allali, Marie-France Sagot
    A New Distance for High Level RNA Secondary Structure Comparison. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2005, v:2, n:1, pp:3-14 [Journal]
  33. Alexandra M. Carvalho, Ana T. Freitas, Arlindo L. Oliveira, Marie-France Sagot
    An Efficient Algorithm for the Identification of Structured Motifs in DNA Promoter Sequences. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:2, pp:126-140 [Journal]
  34. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
    Bases of Motifs for Generating Repeated Patterns with Wild Cards. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2005, v:2, n:1, pp:40-50 [Journal]
  35. Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot
    Motif Search in Graphs: Application to Metabolic Networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:4, pp:360-368 [Journal]
  36. Philippe Blayo, Pierre Rouzé, Marie-France Sagot
    Orphan gene finding - an exon assembly approach. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1407-1431 [Journal]
  37. Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    Longest repeats with a block of k don't cares. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:248-254 [Journal]
  38. Marie-France Sagot, Alain Viari, Henry Soldano
    Multiple Sequence Comparison - A Peptide Matching Approach. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:115-137 [Journal]
  39. Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi
    The maximum agreement forest problem: Approximation algorithms and computational experiments. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:91-110 [Journal]
  40. Marília D. V. Braga, Marie-France Sagot, Celine Scornavacca, Eric Tannier
    The Solution Space of Sorting by Reversals. [Citation Graph (0, 0)][DBLP]
    ISBRA, 2007, pp:293-304 [Conf]
  41. Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    All maximal-pairs in step-leap representation of melodic sequence. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2007, v:177, n:9, pp:1954-1962 [Journal]
  42. Yoan Diekmann, Marie-France Sagot, Eric Tannier
    Evolution under Reversals: Parsimony and Conservation of Common Intervals. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2007, v:4, n:2, pp:301-309 [Journal]

  43. Efficient Learning of Bayesian Network Classifiers. [Citation Graph (, )][DBLP]


  44. Multiple Alignment of Biological Networks: A Flexible Approach. [Citation Graph (, )][DBLP]


  45. Mod/Resc Parsimony Inference. [Citation Graph (, )][DBLP]


  46. Efficient representation and P-value computation for high-order Markov motifs. [Citation Graph (, )][DBLP]


  47. Enumerating Precursor Sets of Target Metabolites in a Metabolic Network. [Citation Graph (, )][DBLP]


  48. Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms. [Citation Graph (, )][DBLP]


  49. ISMB/ECCB 2009 Stockholm. [Citation Graph (, )][DBLP]


  50. Cassis: detection of genomic rearrangement breakpoints. [Citation Graph (, )][DBLP]


  51. Precise detection of rearrangement breakpoints in mammalian chromosomes. [Citation Graph (, )][DBLP]


  52. A new distance for high level RNA secondary structure comparison [Citation Graph (, )][DBLP]


  53. Mod/Resc Parsimony Inference [Citation Graph (, )][DBLP]


  54. Repetition-free longest common subsequence. [Citation Graph (, )][DBLP]


Search in 0.161secs, Finished in 0.164secs
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