


default search action
Theoretical Computer Science, Volume 525
Volume 525, March 2014
- Manolis Christodoulakis, Michalis Christou, Maxime Crochemore

, Costas S. Iliopoulos:
On the average number of regularities in a word. 3-9 - James Alexander Edwards

, Uzi Vishkin:
Parallel algorithms for Burrows-Wheeler compression and decompression. 10-22 - Alberto Apostolico, Péter L. Erdös

, István Miklós, Johannes Siemons:
Modulated string searching. 23-29 - Jiong Guo, Danny Hermelin

, Christian Komusiewicz
:
Local search for string problems: Brute-force is essentially optimal. 30-41 - Orgad Keller, Tsvi Kopelowitz, Shir Landau Feibish, Moshe Lewenstein:

Generalized substring compression. 42-54 - Maxime Crochemore

, Alessio Langiu
, Filippo Mignosi
:
Note on the greedy parsing optimality for dictionary-based text compression. 55-59 - Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein:

Detecting approximate periodic patterns. 60-67 - Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi

, Takeshi Tokuyama:
Order-preserving matching. 68-79 - Carl Barton, Costas S. Iliopoulos, Inbok Lee, Laurent Mouchard, Kunsoo Park, Solon P. Pissis

:
Extending alignments with k-mismatches and ℓ-gaps. 80-88 - Laxmi Parida, Cinzia Pizzi, Simona E. Rombo:

Irredundant tandem motifs. 89-102 - Dina Sokol

, Justin Tojeira:
Speeding up the detection of tandem repeats over the edit distance. 103-110 - Oren Ben-Kiki, Philip Bille

, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann
:
Towards optimal packed string matching. 111-129 - Ferdinando Cicalese, Eduardo Sany Laber, Oren Weimann

, Raphael Yuster
:
Approximating the maximum consecutive subsums of a sequence. 130-137 - Ury Matarazzo, Dekel Tsur

, Michal Ziv-Ukelson:
Efficient all path score computations on grid graphs. 138-149

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














