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="Crochemore, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Extracting powers and periods in a word from its runs structure
M. Crochemore
,
C.S. Iliopoulos
,
M. Kubica
,
J. Radoszewski
,
W. Rytter
,
T. Waleń
Theoretical Computer Science
521
, 2014, pp. 29-41
Efficient seed computation revisited
M. Christou
,
M. Crochemore
,
C.S. Iliopoulos
,
M. Kubica
,
S.P. Pissis
,
J. Radoszewski
,
W. Rytter
,
B. Szreder
,
T. Waleń
Theoretical Computer Science
483
, 2013, pp. 171-181
A note on efficient computation of all Abelian periods in a string
M. Crochemore
,
C.S. Iliopoulos
,
T. Kociumaka
,
M. Kubica
,
J. Pachocki
,
J. Radoszewski
,
W. Rytter
,
W. Tyczyński
,
T. Waleń
Information Processing Letters
113
(3), 2013, pp. 74-77
The maximal number of cubic runs in a word
M. Crochemore
,
C.S. Iliopoulos
,
M. Kubica
,
J. Radoszewski
,
W. Rytter
,
T. Waleń
Journal of Computer and System Sciences
78
(6), 2012, pp. 1828-1836
From Nerode's congruence to suffix automata with mismatches
M. Crochemore
,
C. Epifanio
,
A. Gabriele
,
F. Mignosi
Theoretical Computer Science
410
(37), 2009, pp. 3471-3480
Waiting time and complexity for matching patterns with automata
M. Crochemore
,
V.T. Stefanov
Information Processing Letters
87
(3), 2003, pp. 119-125
A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum
N. Pisanti
,
M. Crochemore
,
R. Grossi
,
M.-F. Sagot
Lecture Notes in Computer Science
2747
, 2003, pp. 622-631
Two-dimensional prefix string matching and covering on square matrices
M. Crochemore
,
C.S. Iliopoulos
,
M. Korda
Algorithmica
20
(4), 1998, pp. 353-373
Minimal forbidden words and factor automata
M. Crochemore
,
F. Mignosi
,
A. Restivo
Lecture Notes in Computer Science
1450
, 1998, pp. 665-673
Fast parallel Lyndon factorization with applications
A. Apostolico
,
M. Crochemore
Math. Systems Theory
28
(2), 1995, pp. 89-108
Squares, cubes, and time-space efficient string searching
M. Crochemore
,
W. Rytter
Algorithmica
13
, 1995, pp. 405-425
Speeding up two string-matching algorithms
M. Crochemore
,
A. Czumaj
,
L. Gasieniec
,
S. Jarominek
,
T. Lecroq
,
W. Plandowski
,
W. Rytter
Algorithmica
12
, 1994, pp. 247-267
A linear time pattern matching algorithm between a string and a tree
Tatsuya Akutsu
Lecture Notes in Computer Science
684
, 1993, pp. 1-10
Tight comparison bounds for the string prefix-matching problem
Dany Breslauer
,
Livio Colussi
,
Laura Toniolo
Lecture Notes in Computer Science
684
, 1993, pp. 11-19
3-D docking of protein molecules
Daniel Fischer
,
Raquel Norel
,
Ruth Nussinov
,
Haim J. Wolfson
Lecture Notes in Computer Science
684
, 1993, pp. 20-34
Minimal separators of two words
Emmanuelle Garel
Lecture Notes in Computer Science
684
, 1993, pp. 35-53
Covering a string
Costas S. Iliopoulos
,
Dennis W.G. Moore
,
Kunsoo Park
Lecture Notes in Computer Science
684
, 1993, pp. 54-62
On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of
k
strings
Robert W. Irving
,
Campbell B. Fraser
Lecture Notes in Computer Science
684
, 1993, pp. 63-73
An algorithm for locating non-overlapping regions of maximum alignment score
Sampath K. Kannan
,
Eugene W. Myers
Lecture Notes in Computer Science
684
, 1993, pp. 74-86
Exact and approximation algorithms for the inversion distance between two chromosomes
John Kececioglu
,
David Sankoff
Lecture Notes in Computer Science
684
, 1993, pp. 87-105
The maximum weight trace problem in multiple sequence alignment
John Kececioglu
Lecture Notes in Computer Science
684
, 1993, pp. 106-119
An algorithm for approximate tandem repeats
Gad M. Landau
,
Jeanette P. Schmidt
Lecture Notes in Computer Science
684
, 1993, pp. 120-133
Two dimensional pattern matching in a digitized image
Gad M. Landau
,
Uzi Vishkin
Lecture Notes in Computer Science
684
, 1993, pp. 134-151
Analysis of a string edit problem in a probabilistic framework
Guy Louchard
,
Wojciech Szpankowski
Lecture Notes in Computer Science
684
, 1993, pp. 152-163
Detecting false matches in string matching algorithms
S. Muthukrishnan
Lecture Notes in Computer Science
684
, 1993, pp. 164-178
Seiten 1
2
3
>