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: Journal=Theor.~Comput.~Sci. AND Volume=525
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the average number of regularities in a word
Manolis Christodoulakis
,
Michalis Christou
,
Maxime Crochemore
,
Costas S. Iliopoulos
Theoretical Computer Science
525
, 2014, pp. 3-9
Parallel algorithms for Burrows-Wheeler compression and decompression
James A. Edwards
,
Uzi Vishkin
Theoretical Computer Science
525
, 2014, pp. 10-22
Modulated string searching
Alberto Apostolico
,
Péter L. Erdŏs
,
István Miklós
,
Johannes Siemons
Theoretical Computer Science
525
, 2014, pp. 23-29
Local search for string problems: Brute-force is essentially optimal
Jiong Guo
,
Danny Hermelin
,
Christian Komusiewicz
Theoretical Computer Science
525
, 2014, pp. 30-41
Generalized substring compression
Orgad Keller
,
Tsvi Kopelowitz
,
Shir Landau Feibish
,
Moshe Lewenstein
Theoretical Computer Science
525
, 2014, pp. 42-54
Note on the greedy parsing optimality for dictionary-based text compression
Maxime Crochemore
,
Alessio Langiu
,
Filippo Mignosi
Theoretical Computer Science
525
, 2014, pp. 55-59
Detecting approximate periodic patterns
Amihood Amir
,
Alberto Apostolico
,
Estrella Eisenberg
,
Gad M. Landau
,
Avivit Levy
,
Noa Lewenstein
Theoretical Computer Science
525
, 2014, pp. 60-67
Order-preserving matching
Jinil Kim
,
Peter Eades
,
Rudolf Fleischer
,
Seok-Hee Hong
,
Costas S. Iliopoulos
,
Kunsoo Park
,
Simon J. Puglisi
,
Takeshi Tokuyama
Theoretical Computer Science
525
, 2014, pp. 68-79
Extending alignments with
k
-mismatches and
\ell
-gaps
Carl Barton
,
Costas S. Iliopoulos
,
Inbok Lee
,
Laurent Mouchard
,
Kunsoo Park
,
Solon P. Pissis
Theoretical Computer Science
525
, 2014, pp. 80-88
Irredundant tandem motifs
Laxmi Parida
,
Cinzia Pizzi
,
Simona E. Rombo
Theoretical Computer Science
525
, 2014, pp. 89-102
Speeding up the detection of tandem repeats over the edit distance
Dina Sokol
,
Justin Tojeira
Theoretical Computer Science
525
, 2014, pp. 103-110
Towards optimal packed string matching
Oren Ben-Kiki
,
Philip Bille
,
Dany Breslauer
,
Leszek Ga̧sieniec
,
Roberto Grossi
,
Oren Weimann
Theoretical Computer Science
525
, 2014, pp. 111-129
Approximating the maximum consecutive subsums of a sequence
Ferdinando Cicalese
,
Eduardo Laber
,
Oren Weimann
,
Raphael Yuster
Theoretical Computer Science
525
, 2014, pp. 130-137
Efficient all path score computations on grid graphs
Ury Matarazzo
,
Dekel Tsur
,
Michal Ziv-Ukelson
Theoretical Computer Science
525
, 2014, pp. 138-149