Symposium on String Processing and Information Retrieval (SPIRE) (2018)

↑ up

String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings

doi dblp
String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings
doi dblp
Recoloring the Colored de Bruijn Graph.
Bahar Alipanahi|Alan Kuhnle|Christina Boucher
doi dblp
Efficient Computation of Sequence Mappability.
Mai Alzamel|Panagiotis Charalampopoulos|Costas S. Iliopoulos|Tomasz Kociumaka|Solon P. Pissis|Jakub Radoszewski|Juliusz Straszynski
doi dblp
Searching for a Modified Pattern in a Changing Text.
Amihood Amir|Eitan Kondratovsky
doi dblp
Longest Common Prefixes with k-Errors and Applications.
Lorraine A. K. Ayad|Carl Barton|Panagiotis Charalampopoulos|Costas S. Iliopoulos|Solon P. Pissis
doi dblp
Longest Property-Preserved Common Factor.
Lorraine A. K. Ayad|Giulia Bernardini|Roberto Grossi|Costas S. Iliopoulos|Nadia Pisanti|Solon P. Pissis|Giovanna Rosone
doi dblp
Adaptive Computation of the Discrete Fréchet Distance.
Jérémy Barbay
doi dblp
Indexed Dynamic Programming to Boost Edit Distance and LCSS Computation.
Jérémy Barbay|Andrés Olivares
doi dblp
Compressed Communication Complexity of Longest Common Prefixes.
Philip Bille|Mikko Berggren Ettienne|Roberto Grossi|Inge Li Gørtz|Eva Rotenberg
doi dblp
New Structures to Solve Aggregated Queries for Trips over Public Transportation Networks.
Nieves R. Brisaboa|Antonio Fariña|Daniil Galaktionov|Tirso V. Rodeiro|M. Andrea Rodríguez
doi dblp
3DGraCT: A Grammar-Based Compressed Representation of 3D Trajectories.
Nieves R. Brisaboa|Adrián Gómez-Brandón|Miguel A. Martínez-Prieto|José R. Paramá
doi dblp
Towards a Compact Representation of Temporal Rasters.
Ana Cerdeira-Pena|Guillermo de Bernardo|Antonio Fariña|José R. Paramá|Fernando Silva-Coira
doi dblp
On Extended Special Factors of a Word.
Panagiotis Charalampopoulos|Maxime Crochemore|Solon P. Pissis
doi dblp
Truncated DAWGs and Their Application to Minimal Absent Word Problem.
Yuta Fujishige|Takuya Takagi|Diptarama Hendrian
doi dblp
The Colored Longest Common Prefix Array Computed via Sequential Scans.
Fabio Garofalo|Giovanna Rosone|Marinella Sciortino|Davide Verzotto
doi dblp
Early Commenting Features for Emotional Reactions Prediction.
Anastasia Giachanou|Paolo Rosso|Ida Mele|Fabio Crestani
doi dblp
Block Palindromes: A New Generalization of Palindromes.
Keisuke Goto|Tomohiro I|Hideo Bannai|Shunsuke Inenaga
doi dblp
Maximal Motif Discovery in a Sliding Window.
Costas S. Iliopoulos|Manal Mohamed|Solon P. Pissis|Fatima Vayani
doi dblp
Compressed Range Minimum Queries.
Seungbum Jo|Shay Mozes|Oren Weimann
doi dblp
Fast Wavelet Tree Construction in Practice.
Yusaku Kaneta
doi dblp
Faster Recovery of Approximate Periods over Edit Distance.
Tomasz Kociumaka|Jakub Radoszewski|Wojciech Rytter|Juliusz Straszynski|Tomasz Walen|Wiktor Zuba
doi dblp
Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays.
Yuki Kuhara|Yuto Nakashima|Shunsuke Inenaga|Hideo Bannai|Masayuki Takeda
doi dblp
Optimal In-Place Suffix Sorting.
Zhize Li|Jian Li|Hongwei Huo
doi dblp
Computing Burrows-Wheeler Similarity Distributions for String Collections.
Felipe A. Louza|Guilherme P. Telles|Simon Gog|Liang Zhao
doi dblp
Better Heuristic Algorithms for the Repetition Free LCS and Other Variants.
Radu Stefan Mincu|Alexandru Popa
doi dblp
Linear-Time Online Algorithm Inferring the Shortest Path from a Walk.
Shintaro Narisada|Diptarama Hendrian|Ryo Yoshinaka|Ayumi Shinohara
doi dblp
Trickier XBWT Tricks.
Enno Ohlebusch|Stefan Stauß|Uwe Baier
doi dblp
Fast and Effective Neural Networks for Translating Natural Language into Denotations.
Tiago Pimentel|Juliano Viana|Adriano Veloso|Nivio Ziviani
doi dblp
Faster and Smaller Two-Level Index for Network-Based Trajectories.
Rodrigo Rivera|M. Andrea Rodríguez|Diego Seco