Abstract is missing.
- Faster Exact Search Using Document ClusteringJonathan Dimond, Peter Sanders. 1-12 [doi]
- Fast Online Lempel-Ziv Factorization in Compressed SpaceAlberto Policriti, Nicola Prezza. 13-20 [doi]
- Adaptive Computation of the Swap-Insert Correction DistanceJérémy Barbay, Pablo Pérez-Lantero. 21-32 [doi]
- Transforming XML Streams with ReferencesSebastian Maneth, Alberto Ordóñez Pereira, Helmut Seidl. 33-45 [doi]
- Efficient Term Set Prediction Using the Bell-Wigner InequalityMassimo Melucci. 46-53 [doi]
- On Prefix/Suffix-Square Free WordsMarius Dumitran, Florin Manea, Dirk Nowotka. 54-66 [doi]
- Temporal Analysis of CHAVE CollectionOlga Craveiro, Joaquim Macedo, Henrique Madeira. 67-74 [doi]
- DeShaTo: Describing the Shape of Cumulative Topic Distributions to Rank Retrieval Systems Without Relevance JudgmentsRadu-Tudor Ionescu, Adrian-Gabriel Chifu, Josiane Mothe. 75-82 [doi]
- Induced Sorting Suffixes in External Memory with Better Design and Less SpaceWeijun Liu, Ge Nong, Wai Hong Chan, Yi Wu. 83-94 [doi]
- Efficient Algorithms for Longest Closed Factor ArrayHideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen. 95-102 [doi]
- A Compact RDF Store Using Suffix ArraysNieves R. Brisaboa, Ana Cerdeira-Pena, Antonio Fariña, Gonzalo Navarro. 103-115 [doi]
- Chaining Fragments in Sequences: to Sweep or Not (Extended Abstract)Julien Allali, Cédric Chauve, Laetitia Bourgeade. 116-123 [doi]
- A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a StringYuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 124-136 [doi]
- Selective Labeling and Incomplete Label Mitigation for Low-Cost EvaluationKai Hui, Klaus Berberich. 137-148 [doi]
- Relative SelectChristina Boucher, Alexander Bowe, Travis Gagie, Giovanni Manzini, Jouni Sirén. 149-155 [doi]
- Temporal Query Classification at Different GranularitiesDhruv Gupta 0002, Klaus Berberich. 156-164 [doi]
- Prefix and Suffix Reversals on StringsGuillaume Fertin, Loïc Jankowiak, Géraldine Jean. 165-176 [doi]
- Filtration Algorithms for Approximate Order-Preserving MatchingTamanna Chhabra, Emanuele Giaquinta, Jorma Tarhio. 177-187 [doi]
- Fishing in Read Collections: Memory Efficient Indexing for Sequence AssemblyVladimír Boza, Jakub Jursa, Brona Brejová, Tomás Vinar. 188-198 [doi]
- How Big is that Genome? Estimating Genome Size and Coverage from k-mer Abundance SpectraMichal Hozza, Tomás Vinar, Brona Brejová. 199-209 [doi]
- Assessing the Efficiency of Suffix Stripping Approaches for Portuguese StemmingWadson Gomes Ferreira, Willian Antônio dos Santos, Breno Macena Pereira de Souza, Tiago Matta Machado Zaidan, Wladmir Cardoso Brandão. 210-221 [doi]
- Space-Efficient Detection of Unusual WordsDjamal Belazzougui, Fabio Cunial. 222-233 [doi]
- Parallel Construction of Succinct Representations of Suffix Tree TopologiesUwe Baier, Timo Beller, Enno Ohlebusch. 234-245 [doi]
- Computing the Longest Unbordered SubstringPawel Gawrychowski, Gregory Kucherov, Benjamin Sach, Tatiana A. Starikovskaya. 246-257 [doi]
- Online Self-Indexed Grammar CompressionYoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto. 258-269 [doi]
- Tight Bound for the Number of Distinct Palindromes in a TreePawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen. 270-276 [doi]
- Beyond the Runs TheoremJohannes Fischer 0001, Stepan Holub, Tomohiro I, Moshe Lewenstein. 277-286 [doi]
- Sampling the Suffix Array with MinimizersSzymon Grabowski, Marcin Raniszewski. 287-298 [doi]
- Longest Common Prefix with MismatchesGiovanni Manzini. 299-310 [doi]
- Evaluating Geographical Knowledge Re-Ranking, Linguistic Processing and Query Expansion Techniques for Geographical Information RetrievalDaniel Ferrés, Horacio Rodríguez. 311-323 [doi]
- Improved Practical Compact Dynamic TriesAndreas Poyias, Rajeev Raman. 324-336 [doi]
- ShRkC: Shard Rank Cutoff Prediction for Selective SearchAnagha Kulkarni. 337-349 [doi]
- Range LCP Queries RevisitedAmihood Amir, Moshe Lewenstein, Sharma V. Thankachan. 350-361 [doi]
- Feasibility of Word Difficulty PredictionRicardo A. Baeza-Yates, Martí Mayo-Casademont, Luz Rello. 362-373 [doi]