default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22. SPIRE 2015: London, UK
- Costas S. Iliopoulos, Simon J. Puglisi
, Emine Yilmaz:
String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings. Lecture Notes in Computer Science 9309, Springer 2015, ISBN 978-3-319-23825-8 - Jonathan Dimond, Peter Sanders:
Faster Exact Search Using Document Clustering. 1-12 - Alberto Policriti, Nicola Prezza:
Fast Online Lempel-Ziv Factorization in Compressed Space. 13-20 - Jérémy Barbay, Pablo Pérez-Lantero:
Adaptive Computation of the Swap-Insert Correction Distance. 21-32 - Sebastian Maneth, Alberto Ordóñez Pereira, Helmut Seidl:
Transforming XML Streams with References. 33-45 - Massimo Melucci:
Efficient Term Set Prediction Using the Bell-Wigner Inequality. 46-53 - Marius Dumitran, Florin Manea, Dirk Nowotka:
On Prefix/Suffix-Square Free Words. 54-66 - Olga Craveiro, Joaquim Macedo, Henrique Madeira:
Temporal Analysis of CHAVE Collection. 67-74 - Radu Tudor Ionescu, Adrian-Gabriel Chifu, Josiane Mothe:
DeShaTo: Describing the Shape of Cumulative Topic Distributions to Rank Retrieval Systems Without Relevance Judgments. 75-82 - Weijun Liu, Ge Nong, Wai Hong Chan, Yi Wu:
Induced Sorting Suffixes in External Memory with Better Design and Less Space. 83-94 - Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen:
Efficient Algorithms for Longest Closed Factor Array. 95-102 - Nieves R. Brisaboa, Ana Cerdeira-Pena, Antonio Fariña, Gonzalo Navarro:
A Compact RDF Store Using Suffix Arrays. 103-115 - Julien Allali, Cédric Chauve, Laetitia Bourgeade:
Chaining Fragments in Sequences: to Sweep or Not (Extended Abstract). 116-123 - Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String. 124-136 - Kai Hui, Klaus Berberich:
Selective Labeling and Incomplete Label Mitigation for Low-Cost Evaluation. 137-148 - Christina Boucher, Alexander Bowe, Travis Gagie, Giovanni Manzini, Jouni Sirén:
Relative Select. 149-155 - Dhruv Gupta, Klaus Berberich:
Temporal Query Classification at Different Granularities. 156-164 - Guillaume Fertin, Loïc Jankowiak, Géraldine Jean:
Prefix and Suffix Reversals on Strings. 165-176 - Tamanna Chhabra, Emanuele Giaquinta, Jorma Tarhio:
Filtration Algorithms for Approximate Order-Preserving Matching. 177-187 - Vladimír Boza, Jakub Jursa, Brona Brejová, Tomás Vinar:
Fishing in Read Collections: Memory Efficient Indexing for Sequence Assembly. 188-198 - Michal Hozza, Tomás Vinar, Brona Brejová:
How Big is that Genome? Estimating Genome Size and Coverage from k-mer Abundance Spectra. 199-209 - Wadson Gomes Ferreira, Willian Antônio dos Santos, Breno Macena Pereira de Souza, Tiago Matta Machado Zaidan, Wladmir Cardoso Brandão:
Assessing the Efficiency of Suffix Stripping Approaches for Portuguese Stemming. 210-221 - Djamal Belazzougui, Fabio Cunial:
Space-Efficient Detection of Unusual Words. 222-233 - Uwe Baier, Timo Beller, Enno Ohlebusch:
Parallel Construction of Succinct Representations of Suffix Tree Topologies. 234-245 - Pawel Gawrychowski, Gregory Kucherov, Benjamin Sach, Tatiana Starikovskaya:
Computing the Longest Unbordered Substring. 246-257 - Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto:
Online Self-Indexed Grammar Compression. 258-269 - Pawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen:
Tight Bound for the Number of Distinct Palindromes in a Tree. 270-276 - Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein:
Beyond the Runs Theorem. 277-286 - Szymon Grabowski, Marcin Raniszewski:
Sampling the Suffix Array with Minimizers. 287-298 - Giovanni Manzini:
Longest Common Prefix with Mismatches. 299-310 - Daniel Ferrés, Horacio Rodríguez:
Evaluating Geographical Knowledge Re-Ranking, Linguistic Processing and Query Expansion Techniques for Geographical Information Retrieval. 311-323 - Andreas Poyias, Rajeev Raman:
Improved Practical Compact Dynamic Tries. 324-336 - Anagha Kulkarni:
ShRkC: Shard Rank Cutoff Prediction for Selective Search. 337-349 - Amihood Amir, Moshe Lewenstein, Sharma V. Thankachan:
Range LCP Queries Revisited. 350-361 - Ricardo Baeza-Yates, Martí Mayo-Casademont, Luz Rello:
Feasibility of Word Difficulty Prediction. 362-373
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 2026-03-05 22:34 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:
