Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=7922

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Forty years of text indexing
Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
Lecture Notes in Computer Science 7922, 2013, pp. 1-10
LCP magic
Moshe Lewenstein
Lecture Notes in Computer Science 7922, 2013, pp. 11-11
Discrete methods for image analysis applied to molecular biology
Gene Myers
Lecture Notes in Computer Science 7922, 2013, pp. 12-12
Locating all maximal approximate runs in a string
Mika Amit, Maxime Crochemore, Gad M. Landau
Lecture Notes in Computer Science 7922, 2013, pp. 13-27
On minimal and maximal suffixes of a substring
Maxim Babenko, Ignat Kolesnichenko, Tatiana Starikovskaya
Lecture Notes in Computer Science 7922, 2013, pp. 28-37
Converting SLP to LZ78 in almost linear time
Hideo Bannai, Paweƚ Gawrychowski, Shunsuke Inenaga, Masayuki Takeda
Lecture Notes in Computer Science 7922, 2013, pp. 38-49
A bit-parallel, general integer-scoring sequence alignment algorithm
Gary Benson, Yozen Hernandez, Joshua Loving
Lecture Notes in Computer Science 7922, 2013, pp. 50-61
Compact q-gram profiling of compressed strings
Philip Bille, Patrick Hagge Cording, Inge Li Grtz
Lecture Notes in Computer Science 7922, 2013, pp. 62-73
A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
Lecture Notes in Computer Science 7922, 2013, pp. 74-82
Pattern matching with variables: A multivariate complexity analysis
Henning Fernau, Markus L. Schmid
Lecture Notes in Computer Science 7922, 2013, pp. 83-94
New algorithms for position heaps
Travis Gagie, Wing-Kai Hon, Tsung-Han Ku
Lecture Notes in Computer Science 7922, 2013, pp. 95-106
Document listing on repetitive collections
Travis Gagie, Kalle Karhu, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén
Lecture Notes in Computer Science 7922, 2013, pp. 107-119
Approximating shortest superstring problem using de Bruijn graphs
Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin
Lecture Notes in Computer Science 7922, 2013, pp. 120-129
Local search for string problems: Brute force is essentially optimal
Jiong Guo, Danny Hermelin, Christian Komusiewicz
Lecture Notes in Computer Science 7922, 2013, pp. 130-141
Space-efficient construction algorithm for the circular suffix tree
Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan
Lecture Notes in Computer Science 7922, 2013, pp. 142-152
Efficient Lyndon factorization of grammar compressed text
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Lecture Notes in Computer Science 7922, 2013, pp. 153-164
Approximation of grammar-based compression via recompression
Artur Jeż
Lecture Notes in Computer Science 7922, 2013, pp. 165-176
Fast algorithm for partial covers in words
Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
Lecture Notes in Computer Science 7922, 2013, pp. 177-188
Linear time Lempel-Ziv factorization: Simple, fast, small
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Lecture Notes in Computer Science 7922, 2013, pp. 189-200
External memory generalized suffix and LCP arrays construction
Felipe A. Louza, Guilherme P. Telles, Cristina Dutra De Aguiar Ciferri
Lecture Notes in Computer Science 7922, 2013, pp. 201-210
Efficient all path score computations on grid graphs
Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson
Lecture Notes in Computer Science 7922, 2013, pp. 211-222
Time-space trade-offs for the longest common substring problem
Tatiana Starikovskaya, Hjalte Wedel Vildhj
Lecture Notes in Computer Science 7922, 2013, pp. 223-234
A succinct grammar compression
Yasuo Tabei, Yoshimasa Takabatake, Hiroshi Sakamoto
Lecture Notes in Computer Science 7922, 2013, pp. 235-246
Data structure lower bounds on random access to grammar-compressed strings
Elad Verbin, Wei Yu
Lecture Notes in Computer Science 7922, 2013, pp. 247-258