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
Hilfe
Suche: Author="Vialette, St{\'e}phane"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Single and multiple consecutive permutation motif search
Djamal Belazzougui
,
Adeline Pierrot
,
Mathieu Raffinot
,
Stéphane Vialette
Lecture Notes in Computer Science
8283
, 2013, pp. 66-77
Finding approximate and constrained motifs in graphs
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
Theoretical Computer Science
483
, 2013, pp. 10-21
On the combinatorics of suffix arrays
Gregory Kucherov
,
Lilla Tóthmérész
,
Stéphane Vialette
Information Processing Letters
113
(22-24), 2013, pp. 915-920
Hardness of longest common subsequence for sequences with bounded run-lengths
Guillaume Blin
,
Laurent Bulteau
,
Minghui Jiang
,
Pedro J. Tejada
,
Stéphane Vialette
Lecture Notes in Computer Science
7354
, 2012, pp. 138-148
A faster algorithm for finding minimum Tucker submatrices
Guillaume Blin
,
Romeo Rizzi
,
Stéphane Vialette
Theory of Computing Systems
51
(3), 2012, pp. 270-281
Algorithmic aspects of the intersection and overlap numbers of a graph
Danny Hermelin
,
Romeo Rizzi
,
Stéphane Vialette
Lecture Notes in Computer Science
7676
, 2012, pp. 465-474
Finding approximate and constrained motifs in graphs
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
Lecture Notes in Computer Science
6661
, 2011, pp. 388-401
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Michael R. Fellows
,
Guillaume Fertin
,
Danny Hermelin
,
Stéphane Vialette
Journal of Computer and System Sciences
77
(4), 2011, pp. 799-811
Complexity issues in color-preserving graph embeddings
Gaëlle Brevier
,
Romeo Rizzi
,
Stéphane Vialette
Theoretical Computer Science
411
(4-5), 2010, pp. 716-729
Finding common structured patterns in linear graphs
Guillaume Fertin
,
Danny Hermelin
,
Romeo Rizzi
,
Stéphane Vialette
Theoretical Computer Science
411
(26-28), 2010, pp. 2475-2486
Pseudo Boolean programming for partially ordered genomes
Sébastien Angibaud
,
Guillaume Fertin
,
Annelyse Thévenin
,
Stéphane Vialette
Lecture Notes in Computer Science
5817
, 2009, pp. 126-137
Maximum motif problem in vertex-colored graphs
Riccardo Dondi
,
Guillaume Fertin
,
Stéphane Vialette
Lecture Notes in Computer Science
5577
, 2009, pp. 221-235
On finding small 2-generating sets
Isabelle Fagnot
,
Guillaume Fertin
,
Stéphane Vialette
Lecture Notes in Computer Science
5609
, 2009, pp. 378-387
Pattern matching for 321-avoiding permutations
Sylvain Guillemot
,
Stéphane Vialette
Lecture Notes in Computer Science
5878
, 2009, pp. 1064-1073
An evolutionary study of the human papillomavirus genomes
Dunarel Badescu
,
Abdoulaye Baniré Diallo
,
Mathieu Blanchette
,
Vladimir Makarenkov
LNCS/LNBI
5267
, 2008, pp. 128-142
Perfect DCJ rearrangement
S`everine Bérard
,
Annie Chateau
,
Cedric Chauve
,
Christophe Paul
,
Eric Tannier
LNCS/LNBI
5267
, 2008, pp. 158-169
On computing the breakpoint reuse rate in rearrangement scenarios
Anne Bergeron
,
Julia Mixtacki
,
Jens Stoye
LNCS/LNBI
5267
, 2008, pp. 226-240
An algorithm for inferring mitogenome rearrangements in a phylogenetic tree
Matthias Bernt
,
Daniel Merkle
,
Martin Middendorf
LNCS/LNBI
5267
, 2008, pp. 143-157
A phylogenetic approach to genetic map refinement
Denis Bertrand
,
Mathieu Blanchette
,
Nadia El-Mabrouk
LNCS/LNBI
5267
, 2008, pp. 198-210
Limitations of pseudogenes in identifying gene losses
James C. Costello
,
Mira V. Han
,
Matthew W. Hahn
LNCS/LNBI
5267
, 2008, pp. 14-25
Approximating the 2-interval pattern problem
Maxime Crochemore
,
Danny Hermelin
,
Gad M. Landau
,
Dror Rawitz
,
Stéphane Vialette
Theoretical Computer Science
395
(2-3), 2008, pp. 283-297
Ancestral reconstruction by asymmetric Wagner parsimony over continuous characters and squared parsimony over distributions
Miklós Csŭrös
LNCS/LNBI
5267
, 2008, pp. 72-86
Algorithms for exploring the space of gene tree/species tree reconciliations
Jean-Philippe Doyon
,
Cedric Chauve
,
Sylvie Hamel
LNCS/LNBI
5267
, 2008, pp. 1-13
Discovering local patterns of co-evolution
Yifat Felder
,
Tamir Tuller
LNCS/LNBI
5267
, 2008, pp. 55-71
An alignment-free distance measure for closely related genomes
Bernhard Haubold
,
Mirjana Domazet-Los̑o
,
Thomas Wiehe
LNCS/LNBI
5267
, 2008, pp. 87-99
Seiten 1
2
>