Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Sagot, Marie-France"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Amortized
\tilde{O}(|V|)
-delay algorithm for listing chordless cycles in undirected graphs
Rui Ferreira
,
Roberto Grossi
,
Romeo Rizzi
,
Gustavo Sacomoto
,
Marie-France Sagot
Lecture Notes in Computer Science
8737
, 2014, pp. 418-429
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets
Vicente Acuña
,
Etienne Birmelé
,
Ludovic Cottret
,
Pierluigi Crescenzi
,
Fabien Jourdan
,
Vincent Lacroix
,
Alberto Marchetti-Spaccamela
,
Andrea Marino
,
Paulo Vieira Milreu
,
Marie-France Sagot
,
Leen Stougie
Theoretical Computer Science
457
, 2012, pp. 1-9
Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks
Vicente Acuña
,
Paulo Vieira Milreu
,
Ludovic Cottret
,
Alberto Marchetti-Spaccamela
,
Leen Stougie
,
Marie-France Sagot
Bioinformatics
28
(19), 2012, pp. 2474-2483
Navigating the unexplored seascape of pre-miRNA candidates in single-genome approaches
Nuno D. Mendes
,
Steffen Heyne
,
Ana T. Freitas
,
Marie-France Sagot
,
Rolf Backofen
Bioinformatics
28
(23), 2012, pp. 3034-3041
Mod/Resc Parsimony Inference: Theory and application
Igor Nor
,
Danny Hermelin
,
Sylvain Charlat
,
Jan Engelstadter
,
Max Reuter
,
Olivier Duron
,
Marie-France Sagot
Information and Computation
213
, 2012, pp. 23-32
Cassis: Detection of genomic rearrangement breakpoints
Christian Baudet
,
Claire Lemaitre
,
Zanoni Dias
,
Christian Gautier
,
Eric Tannier
,
Marie-France Sagot
Bioinformatics
26
(15), 2010, pp. 1897-1898
Mod/Resc Parsimony Inference
Igor Nor
,
Danny Hermelin
,
Sylvain Charlat
,
Jan Engelstadter
,
Max Reuter
,
Olivier Duron
,
Marie-France Sagot
Lecture Notes in Computer Science
6129
, 2010, pp. 202-213
Multiple alignment of biological networks: A flexible approach
Yves-Pol Deniélou
,
Frédéric Boyer
,
Alain Viari
,
Marie-France Sagot
Lecture Notes in Computer Science
5577
, 2009, pp. 263-273
ISMB/ECCB 2009 Stockholm
Marie-France Sagot
,
B.J. Morrison McKay
,
Gene Myers
Bioinformatics
25
(12), 2009, pp. 1570-1573
A small trip in the untranquil world of genomes - A survey on the detection and analysis of genome rearrangement breakpoints
Claire Lemaitre
,
Marie-France Sagot
Theoretical Computer Science
395
(2-3), 2008, pp. 171-192
Indexing gapped-factors using a tree
Pierre Peterlongo
,
Julien Allali
,
Marie-France Sagot
International Journal of Foundations of Computer Science
19
(1), 2008, pp. 71-87
Efficient representation and
P
-value computation for high-order Markov motifs
Paulo G.S. da Fonseca
,
Katia S. Guimarães
,
Marie-France Sagot
Bioinformatics
24
(16), 2008, pp. 160-166
The maximum agreement forest problem: Approximation algorithms and computational experiments
Estela M. Rodrigues
,
Marie-France Sagot
,
Yoshiko Wakabayashi
Theoretical Computer Science
374
(1-3), 2007, pp. 91-110
Longest repeats with a block of
k
don't cares
Maxime Crochemore
,
Costas S. Iliopoulos
,
Manal Mohamed
,
Marie-France Sagot
Theoretical Computer Science
362
(1-3), 2006, pp. 248-254
A first approach to finding common motifs with gaps
Costas S. Iliopoulos
,
James Mchugh
,
Pierre Peterlongo
,
Nadia Pisanti
,
Wojciech Rytter
,
Marie-France Sagot
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1145-1154
Reaction motifs in metabolic networks
Vincent Lacroix
,
Cristina G. Fernandes
,
Marie-France Sagot
LNCS/LNBI
3692
, 2005, pp. 178-191
Perfect sorting by reversals
Marie-France Sagot
,
Eric Tannier
Lecture Notes in Computer Science
3595
, 2005, pp. 42-51
Sorting by reversals in subquadratic time
Eric Tannier
,
Marie-France Sagot
Lecture Notes in Computer Science
3109
, 2004, pp. 1-13
Orphan gene finding - An exon assembly approach
Philippe Blayo
,
Pierre Rouzé
,
Marie-France Sagot
Theoretical Computer Science
290
(3), 2003, pp. 1407-1431
Pattern inference under many guises
Marie-France Sagot
,
Yoshiko Wakabayashi
CMS Books in Mathematics
11
, 2003, pp. 245-287
Further thoughts on the syntenic distance between genomes
Nadia Pisanti
,
Marie-France Sagot
Algorithmica
34
(2), 2002, pp. 157-180
Extracting structured motifs using a suffix tree - Algorithms and application to promoter consensus identification
Laurent Marsan
,
Marie-France Sagot
Proceedings of the 4th Annual International Conference on Computational Molecular Biology, RECOMB'2000 (Tokyo, Japan, April 8-11, 2000)
, 2000, pp. 210-219
Identifying satellites in nucleic acid sequences
Marie-France Sagot
,
Eugene W. Myers
Proceedings of the 2nd Annual International Conference on Computational Molecular Biology, RECOMB'98 (New York, New York, March 22-25, 1998)
, 1998, pp. 234-242
Spelling approximate repeated or common motifs using a suffix tree
Marie-France Sagot
Lecture Notes in Computer Science
1380
, 1998, pp. 374-390
Multiple sequence comparison - A peptide matching approach
Marie-France Sagot
,
Alain Viari
,
Henri Soldano
Theoretical Computer Science
180
(1-2), 1997, pp. 115-137
Seiten 1
2
>