default search action
25. SPIRE 2018: Lima, Peru
- Travis Gagie, Alistair Moffat, Gonzalo Navarro, Ernesto Cuadros-Vargas:
String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings. Lecture Notes in Computer Science 11147, Springer 2018, ISBN 978-3-030-00478-1 - Bahar Alipanahi, Alan Kuhnle, Christina Boucher:
Recoloring the Colored de Bruijn Graph. 1-11 - Mai Alzamel
, Panagiotis Charalampopoulos
Efficient Computation of Sequence Mappability. 12-26 - Lorraine A. K. Ayad
Longest Common Prefixes with k-Errors and Applications. 27-41 - Lorraine A. K. Ayad
Longest Property-Preserved Common Factor. 42-49 - Jérémy Barbay
Adaptive Computation of the Discrete Fréchet Distance. 50-60 - Jérémy Barbay
Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation. 61-73 - Philip Bille
Compressed Communication Complexity of Longest Common Prefixes. 74-87 - Nieves R. Brisaboa
New Structures to Solve Aggregated Queries for Trips over Public Transportation Networks. 88-101 - Nieves R. Brisaboa
3DGraCT: A Grammar-Based Compressed Representation of 3D Trajectories. 102-116 - Ana Cerdeira-Pena
Towards a Compact Representation of Temporal Rasters. 117-130 - Panagiotis Charalampopoulos
On Extended Special Factors of a Word. 131-138 - Yuta Fujishige, Takuya Takagi
Truncated DAWGs and Their Application to Minimal Absent Word Problem. 139-152 - Fabio Garofalo, Giovanna Rosone, Marinella Sciortino, Davide Verzotto
The Colored Longest Common Prefix Array Computed via Sequential Scans. 153-167 - Anastasia Giachanou
Early Commenting Features for Emotional Reactions Prediction. 168-182 - Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga:
Block Palindromes: A New Generalization of Palindromes. 183-190 - Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis
Maximal Motif Discovery in a Sliding Window. 191-205 - Seungbum Jo, Shay Mozes
Compressed Range Minimum Queries. 206-217 - Yusaku Kaneta
Fast Wavelet Tree Construction in Practice. 218-232 - Tomasz Kociumaka
Faster Recovery of Approximate Periods over Edit Distance. 233-240 - Amihood Amir, Eitan Kondratovsky:
Searching for a Modified Pattern in a Changing Text. 241-253 - Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. 254-267 - Zhize Li, Jian Li, Hongwei Huo
Optimal In-Place Suffix Sorting. 268-284 - Felipe A. Louza
Computing Burrows-Wheeler Similarity Distributions for String Collections. 285-296 - Radu Stefan Mincu
Better Heuristic Algorithms for the Repetition Free LCS and Other Variants. 297-310 - Shintaro Narisada, Diptarama Hendrian
Linear-Time Online Algorithm Inferring the Shortest Path from a Walk. 311-324 - Enno Ohlebusch, Stefan Stauß, Uwe Baier:
Trickier XBWT Tricks. 325-333 - Tiago Pimentel, Juliano Viana, Adriano Veloso, Nivio Ziviani:
Fast and Effective Neural Networks for Translating Natural Language into Denotations. 334-347 - Rodrigo Rivera, M. Andrea Rodríguez
Faster and Smaller Two-Level Index for Network-Based Trajectories. 348-362
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.
last updated on 2024-11-26 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: