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