2009 |
57 | EE | Marie-France Sagot:
New EIC Editorial.
IEEE/ACM Trans. Comput. Biology Bioinform. 6(1): 3 (2009) |
2008 |
56 | EE | Paulo G. S. da Fonseca,
Katia S. Guimarães,
Marie-France Sagot:
Efficient representation and P-value computation for high-order Markov motifs.
ECCB 2008: 160-166 |
55 | EE | Ludovic Cottret,
Paulo Vieira Milreu,
Vicente Acuña,
Alberto Marchetti-Spaccamela,
Fábio Viduani Martinez,
Marie-France Sagot,
Leen Stougie:
Enumerating Precursor Sets of Target Metabolites in a Metabolic Network.
WABI 2008: 233-244 |
54 | EE | Julien Allali,
Marie-France Sagot:
A new distance for high level RNA secondary structure comparison
CoRR abs/0810.4002: (2008) |
53 | EE | Said Sadique Adi,
Marília D. V. Braga,
Cristina G. Fernandes,
Carlos Eduardo Ferreira,
Fábio Viduani Martinez,
Marie-France Sagot,
Marco A. Stefanes,
Christian Tjandraatmadja,
Yoshiko Wakabayashi:
Repetition-free longest common subsequence.
Electronic Notes in Discrete Mathematics 30: 243-248 (2008) |
52 | EE | Marília D. V. Braga,
Marie-France Sagot,
Celine Scornavacca,
Eric Tannier:
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(3): 348-356 (2008) |
51 | EE | Vincent Lacroix,
Ludovic Cottret,
Patricia Thébault,
Marie-France Sagot:
An Introduction to Metabolic Networks and Their Structural Analysis.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 594-617 (2008) |
50 | EE | Pierre Peterlongo,
Julien Allali,
Marie-France Sagot:
Indexing Gapped-Factors Using a Tree.
Int. J. Found. Comput. Sci. 19(1): 71-87 (2008) |
49 | EE | Katia S. Guimarães,
Marie-France Sagot:
Editorial.
J. Discrete Algorithms 6(2): 163 (2008) |
48 | EE | Pierre Peterlongo,
Nadia Pisanti,
Frédéric Boyer,
Alair Pereira do Lago,
Marie-France Sagot:
Lossless filter for multiple repetitions with Hamming distance.
J. Discrete Algorithms 6(3): 497-509 (2008) |
47 | EE | Julien Allali,
Marie-France Sagot:
A multiple layer model to compare RNA secondary structures.
Softw., Pract. Exper. 38(8): 775-792 (2008) |
46 | EE | Claire Lemaitre,
Marie-France Sagot:
A small trip in the untranquil world of genomes: A survey on the detection and analysis of genome rearrangement breakpoints.
Theor. Comput. Sci. 395(2-3): 171-192 (2008) |
2007 |
45 | | Marie-France Sagot,
Maria Emilia Telles Walter:
Advances in Bioinformatics and Computational Biology, Second Brazilian Symposium on Bioinformatics, BSB 2007, Angra dos Reis, Brazil, August 29-31, 2007, Proceedings
Springer 2007 |
44 | EE | Alexandra M. Carvalho,
Arlindo L. Oliveira,
Marie-France Sagot:
Efficient Learning of Bayesian Network Classifiers.
Australian Conference on Artificial Intelligence 2007: 16-25 |
43 | EE | Marília D. V. Braga,
Marie-France Sagot,
Celine Scornavacca,
Eric Tannier:
The Solution Space of Sorting by Reversals.
ISBRA 2007: 293-304 |
42 | EE | Eric Tannier,
Anne Bergeron,
Marie-France Sagot:
Advances on sorting by reversals.
Discrete Applied Mathematics 155(6-7): 881-888 (2007) |
41 | EE | Yoan Diekmann,
Marie-France Sagot,
Eric Tannier:
Evolution under Reversals: Parsimony and Conservation of Common Intervals.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(2): 301-309 (2007) |
40 | EE | Emilios Cambouropoulos,
Maxime Crochemore,
Costas S. Iliopoulos,
Manal Mohamed,
Marie-France Sagot:
All maximal-pairs in step-leap representation of melodic sequence.
Inf. Sci. 177(9): 1954-1962 (2007) |
39 | EE | Estela Maris Rodrigues,
Marie-France Sagot,
Yoshiko Wakabayashi:
The maximum agreement forest problem: Approximation algorithms and computational experiments.
Theor. Comput. Sci. 374(1-3): 91-110 (2007) |
2006 |
38 | EE | Nadia Pisanti,
Alexandra M. Carvalho,
Laurent Marsan,
Marie-France Sagot:
RISOTTO: Fast Extraction of Motifs with Mismatches.
LATIN 2006: 757-768 |
37 | EE | Pierre Peterlongo,
Julien Allali,
Marie-France Sagot:
The gapped-factor tree.
Stringology 2006: 182-196 |
36 | EE | 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.
IEEE/ACM Trans. Comput. Biology Bioinform. 3(2): 126-140 (2006) |
35 | EE | Vincent Lacroix,
Cristina G. Fernandes,
Marie-France Sagot:
Motif Search in Graphs: Application to Metabolic Networks.
IEEE/ACM Trans. Comput. Biology Bioinform. 3(4): 360-368 (2006) |
34 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Manal Mohamed,
Marie-France Sagot:
Longest repeats with a block of k don't cares.
Theor. Comput. Sci. 362(1-3): 248-254 (2006) |
2005 |
33 | EE | Alexandra M. Carvalho,
Ana T. Freitas,
Arlindo L. Oliveira,
Marie-France Sagot:
A highly scalable algorithm for the extraction of CIS-regulatory regions.
APBC 2005: 273-282 |
32 | EE | Marie-France Sagot,
Eric Tannier:
Perfect Sorting by Reversals.
COCOON 2005: 42-51 |
31 | EE | 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.
ISMIR 2005: 167-174 |
30 | EE | 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.
SPIRE 2005: 179-190 |
29 | EE | Julien Allali,
Marie-France Sagot:
A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison.
SPIRE 2005: 348-359 |
28 | EE | Vincent Lacroix,
Cristina G. Fernandes,
Marie-France Sagot:
Reaction Motifs in Metabolic Networks.
WABI 2005: 178-191 |
27 | EE | Julien Allali,
Marie-France Sagot:
A New Distance for High Level RNA Secondary Structure Comparison.
IEEE/ACM Trans. Comput. Biology Bioinform. 2(1): 3-14 (2005) |
26 | EE | Nadia Pisanti,
Maxime Crochemore,
Roberto Grossi,
Marie-France Sagot:
Bases of Motifs for Generating Repeated Patterns with Wild Cards.
IEEE/ACM Trans. Comput. Biology Bioinform. 2(1): 40-50 (2005) |
25 | EE | 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.
Int. J. Found. Comput. Sci. 16(6): 1145-1154 (2005) |
2004 |
24 | EE | Eric Tannier,
Marie-France Sagot:
Sorting by Reversals in Subquadratic Time.
CPM 2004: 1-13 |
23 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Manal Mohamed,
Marie-France Sagot:
Longest Repeats with a Block of Don't Cares.
LATIN 2004: 271-278 |
22 | EE | Alexandra M. Carvalho,
Arlindo L. Oliveira,
Ana T. Freitas,
Marie-France Sagot:
A parallel algorithm for the extraction of structured motifs.
SAC 2004: 147-153 |
21 | EE | Alexandra M. Carvalho,
Ana T. Freitas,
Arlindo L. Oliveira,
Marie-France Sagot:
Efficient Extraction of Structured Motifs Using Box-Links.
SPIRE 2004: 267-268 |
20 | EE | Maxime Crochemore,
Raffaele Giancarlo,
Marie-France Sagot:
Longest Motifs with a Functionally Equivalent Central Block.
SPIRE 2004: 298-209 |
19 | EE | 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.
Stringology 2004: 88-97 |
18 | EE | Julien Allali,
Marie-France Sagot:
Novel Tree Edit Operations for RNA Secondary Structure Comparison.
WABI 2004: 412-425 |
2003 |
17 | EE | Nadia Pisanti,
Maxime Crochemore,
Roberto Grossi,
Marie-France Sagot:
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum.
MFCS 2003: 622-631 |
16 | | Philippe Blayo,
Pierre Rouzé,
Marie-France Sagot:
Orphan gene finding - an exon assembly approach.
Theor. Comput. Sci. 290(3): 1407-1431 (2003) |
2002 |
15 | EE | Nadia Pisanti,
Marie-France Sagot:
Further Thoughts on the Syntenic Distance between Genomes.
Algorithmica 34(2): 157-180 (2002) |
14 | | Stéphane Robin,
Jean-Jacques Daudin,
Hugues Richard,
Marie-France Sagot,
Sophie Schbath:
Occurrence Probability of Structured Motifs in Random Sequences.
Journal of Computational Biology 9(6): 761-774 (2002) |
2001 |
13 | | Olivier Gascuel,
Marie-France Sagot:
Computational Biology, First International Conference on Biology, Informatics, and Mathematics, JOBIM 2000, Montpellier, France, May 3-5, 2000, Selected Papers
Springer 2001 |
12 | EE | Estela Maris Rodrigues,
Marie-France Sagot,
Yoshiko Wakabayashi:
Some Approximation Results for the Maximum Agreement Forest Problem.
RANDOM-APPROX 2001: 159-169 |
2000 |
11 | EE | Laurent Marsan,
Marie-France Sagot:
Extracting structured motifs using a suffix tree - algorithms and application to promoter consensus identification.
RECOMB 2000: 210-219 |
10 | | Laurent Marsan,
Marie-France Sagot:
Algorithms for Extracting Structured Motifs Using a Suffix Tree with an Application to Promoter and Regulatory Site Consensus Identification.
Journal of Computational Biology 7(3-4): 345-362 (2000) |
1998 |
9 | EE | Marie-France Sagot:
Spelling Approximate Repeated or Common Motifs Using a Suffix Tree.
LATIN 1998: 374-390 |
8 | EE | Marie-France Sagot,
Eugene W. Myers:
Identifying satellites in nucleic acid sequences.
RECOMB 1998: 234-242 |
7 | | Marie-France Sagot,
Eugene W. Myers:
Identifying Satellites and Periodic Repetitions in Biological Sequences.
Journal of Computational Biology 5(3): 539-554 (1998) |
1997 |
6 | | Marie-France Sagot,
Alain Viari:
Flexible Identification of Structural Objects in Nucleic Acid Sequences: Palindromes, Mirror Repeats, Pseudoknots and Triple Helices.
CPM 1997: 224-246 |
5 | EE | Marie-France Sagot,
Alain Viari,
Henry Soldano:
Multiple Sequence Comparison - A Peptide Matching Approach.
Theor. Comput. Sci. 180(1-2): 115-137 (1997) |
1996 |
4 | | Marie-France Sagot,
Alain Viari:
A Double Combinatorial Approach to Discovering Patterns in Biological Sequences.
CPM 1996: 186-208 |
1995 |
3 | | Marie-France Sagot,
Alain Viari,
Henry Soldano:
Multiple Sequence Comparison: A Peptide Matching Approach.
CPM 1995: 366-385 |
2 | | Marie-France Sagot,
Alain Viari,
Henry Soldano:
A Distance-Based Block Searching Algorithm.
ISMB 1995: 322-331 |
1 | | Marie-France Sagot,
Alain Viari,
Joël Pothier,
Henry Soldano:
Finding flexible patterns in a text: an application to three-dimensional molecular matching.
Computer Applications in the Biosciences 11(1): 59-70 (1995) |