Main » SPIRE »


International Symposium on String Processing and Information Retrieval (2016)


up

String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings

doi dblp
String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings

doi dblp
RLZAP: Relative Lempel-Ziv with Adaptive Pointers
Anthony J. Cox | Andrea Farruggia | Travis Gagie | Simon J. Puglisi | Jouni Sirén

doi dblp
A Linear-Space Algorithm for the Substring Constrained Alignment Problem
Yoshifumi Sakai

doi dblp
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries
Maxime Crochemore | Costas S. Iliopoulos | Tomasz Kociumaka | Ritu Kundu | Solon P. Pissis | Jakub Radoszewski | Wojciech Rytter | Tomasz Walen

doi dblp
The Smallest Grammar Problem Revisited
Danny Hucke | Markus Lohrey | Carl Philipp Reh

doi dblp
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
Antonio Fariña | Travis Gagie | Giovanni Manzini | Gonzalo Navarro | Alberto Ordóñez Pereira

doi dblp
Parallel Lookups in String Indexes
Anders Roy Christiansen | Martin Farach-Colton

doi dblp
Fast Classification of Protein Structures by an Alignment-Free Kernel
Taku Onodera | Tetsuo Shibuya

doi dblp
XBWT Tricks
Giovanni Manzini

doi dblp
Maximal Unbordered Factors of Random Strings
Patrick Hagge Cording | Mathias Bæk Tejs Knudsen

doi dblp
Fragmented BWT: An Extended BWT for Full-Text Indexing
Masaru Ito | Hiroshi Inoue | Kenjiro Taura

doi dblp
AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching
Diptarama | Ryo Yoshinaka | Ayumi Shinohara

doi dblp
Parallel Computation for the All-Pairs Suffix-Prefix Problem
Felipe A. Louza | Simon Gog | Leandro Zanotto | Guido Araujo | Guilherme P. Telles

doi dblp
Dynamic and Approximate Pattern Matching in 2D
Raphaël Clifford | Allyx Fontaine | Tatiana Starikovskaya | Hjalte Wedel Vildhøj

doi dblp
Fully Dynamic de Bruijn Graphs
Djamal Belazzougui | Travis Gagie | Veli Mäkinen | Marco Previtali

doi dblp
Bookmarks in Grammar-Compressed Strings
Patrick Hagge Cording | Pawel Gawrychowski | Oren Weimann

doi dblp
Analyzing Relative Lempel-Ziv Reference Construction
Travis Gagie | Simon J. Puglisi | Daniel Valenzuela

doi dblp
Inverse Range Selection Queries
M. Oguzhan Külekci

doi dblp
Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array
German Tischler

doi dblp
Efficient Representation of Multidimensional Data over Hierarchical Domains
Nieves R. Brisaboa | Ana Cerdeira-Pena | Narciso López-López | Gonzalo Navarro | Miguel R. Penabad | Fernando Silva-Coira

doi dblp
LCP Array Construction Using O(sort(n)) (or Less) I/Os
Juha Kärkkäinen | Dominik Kempa

doi dblp
GraCT: A Grammar Based Compressed Representation of Trajectories
Nieves R. Brisaboa | Adrián Gómez-Brandón | Gonzalo Navarro | José R. Paramá

doi dblp
Lexical Matching of Queries and Ads Bid Terms in Sponsored Search
Ricardo Baeza-Yates | Guoqiang Wang

doi dblp
Compact Trip Representation over Networks
Nieves R. Brisaboa | Antonio Fariña | Daniil Galaktionov | M. Andrea Rodríguez

doi dblp
Longest Common Abelian Factors and Large Alphabets
Golnaz Badkobeh | Travis Gagie | Szymon Grabowski | Yuto Nakashima | Simon J. Puglisi | Shiho Sugimoto

doi dblp
Pattern Matching for Separable Permutations
Both Emerite Neou | Romeo Rizzi | Stéphane Vialette