default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23. SPIRE 2016: Beppu, Japan
- Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai:
String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings. Lecture Notes in Computer Science 9954, 2016, ISBN 978-3-319-46048-2 - Anthony J. Cox, Andrea Farruggia, Travis Gagie
, Simon J. Puglisi, Jouni Sirén:
RLZAP: Relative Lempel-Ziv with Adaptive Pointers. 1-14 - Yoshifumi Sakai:
A Linear-Space Algorithm for the Substring Constrained Alignment Problem. 15-21 - Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. 22-34 - Danny Hucke, Markus Lohrey, Carl Philipp Reh:
The Smallest Grammar Problem Revisited. 35-49 - Antonio Fariña, Travis Gagie, Giovanni Manzini, Gonzalo Navarro, Alberto Ordóñez Pereira:
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes. 50-60 - Anders Roy Christiansen, Martin Farach-Colton:
Parallel Lookups in String Indexes. 61-67 - Taku Onodera, Tetsuo Shibuya:
Fast Classification of Protein Structures by an Alignment-Free Kernel. 68-79 - Giovanni Manzini:
XBWT Tricks. 80-92 - Patrick Hagge Cording, Mathias Bæk Tejs Knudsen:
Maximal Unbordered Factors of Random Strings. 93-96 - Masaru Ito, Hiroshi Inoue, Kenjiro Taura:
Fragmented BWT: An Extended BWT for Full-Text Indexing. 97-109 - Diptarama, Ryo Yoshinaka, Ayumi Shinohara:
AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching. 110-121 - Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles:
Parallel Computation for the All-Pairs Suffix-Prefix Problem. 122-132 - Raphaël Clifford, Allyx Fontaine, Tatiana Starikovskaya, Hjalte Wedel Vildhøj:
Dynamic and Approximate Pattern Matching in 2D. 133-144 - Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali:
Fully Dynamic de Bruijn Graphs. 145-152 - Patrick Hagge Cording, Pawel Gawrychowski, Oren Weimann:
Bookmarks in Grammar-Compressed Strings. 153-159 - Travis Gagie, Simon J. Puglisi, Daniel Valenzuela:
Analyzing Relative Lempel-Ziv Reference Construction. 160-165 - M. Oguzhan Külekci:
Inverse Range Selection Queries. 166-177 - German Tischler:
Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array. 178-190 - Nieves R. Brisaboa, Ana Cerdeira-Pena, Narciso López-López, Gonzalo Navarro, Miguel R. Penabad, Fernando Silva-Coira:
Efficient Representation of Multidimensional Data over Hierarchical Domains. 191-203 - Juha Kärkkäinen, Dominik Kempa:
LCP Array Construction Using O(sort(n)) (or Less) I/Os. 204-217 - Nieves R. Brisaboa, Adrián Gómez-Brandón, Gonzalo Navarro, José R. Paramá:
GraCT: A Grammar Based Compressed Representation of Trajectories. 218-230 - Ricardo Baeza-Yates, Guoqiang Wang:
Lexical Matching of Queries and Ads Bid Terms in Sponsored Search. 231-239 - Nieves R. Brisaboa, Antonio Fariña, Daniil Galaktionov, M. Andrea Rodríguez:
Compact Trip Representation over Networks. 240-253 - Golnaz Badkobeh, Travis Gagie, Szymon Grabowski, Yuto Nakashima, Simon J. Puglisi, Shiho Sugimoto:
Longest Common Abelian Factors and Large Alphabets. 254-259 - Both Emerite Neou, Romeo Rizzi, Stéphane Vialette:
Pattern Matching for Separable Permutations. 260-272
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-09-21 23:42 CEST 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:
