Accepted Papers

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