Abstract is missing.
- Strategic Pattern Search in Factor-Compressed TextSimon Gog, Alistair Moffat, Matthias Petri. 1-12 [doi]
- Relative Lempel-Ziv with Constant-Time Random AccessHéctor Ferrada, Travis Gagie, Simon Gog, Simon J. Puglisi. 13-17 [doi]
- Efficient Compressed Indexing for Approximate Top-k String RetrievalHéctor Ferrada, Gonzalo Navarro. 18-30 [doi]
- Grammar Compressed Sequences with Rank/Select SupportGonzalo Navarro, Alberto Ordóñez Pereira. 31-44 [doi]
- Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded StringsAmihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg. 45-51 [doi]
- Relative FM-IndexesDjamal Belazzougui, Travis Gagie, Simon Gog, Giovanni Manzini, Jouni Sirén. 52-64 [doi]
- Efficient Indexing and Representation of Web Access LogsFrancisco Claude, Roberto Konow, Gonzalo Navarro. 65-76 [doi]
- A Compressed Suffix-Array Strategy for Temporal-Graph IndexingNieves R. Brisaboa, Diego Caro, Antonio Fariña, M. Andrea Rodríguez. 77-88 [doi]
- Succinct Indexes for Reporting Discriminating and Generic WordsSudip Biswas, Manish Patil, Rahul Shah, Sharma V. Thankachan. 89-100 [doi]
- Fast Construction of Wavelet TreesJ. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter. 101-110 [doi]
- Order Preserving Prefix TablesMd. Mahbubul Hasan, A. S. M. Sohidull Islam, Mohammad Saifur Rahman, M. Sohel Rahman. 111-116 [doi]
- Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear TimeEnno Ohlebusch, Timo Beller. 117-128 [doi]
- A 3-Approximation Algorithm for the Multiple Spliced Alignment Problem and Its Application to the Gene Prediction TaskRegina Beretta Mazaro, Leandro Ishi Soares de Lima, Said Sadique Adi. 129-138 [doi]
- Improved Filters for the Approximate Suffix-Prefix Overlap ProblemGregory Kucherov, Dekel Tsur. 139-148 [doi]
- Sequence Decision DiagramsHind Alhakami, Gianfranco Ciardo, Marek Chrobak. 149-160 [doi]
- Shortest Unique Queries on StringsXiaocheng Hu, Jian Pei, Yufei Tao. 161-172 [doi]
- Online Multiple Palindrome Pattern MatchingHwee Kim, Yo-Sub Han. 173-178 [doi]
- Indexed Matching Statistics and Shortest Unique SubstringsDjamal Belazzougui, Fabio Cunial. 179-190 [doi]
- I/O-Efficient Dictionary Search with One Edit ErrorChin-Wan Chung, Yufei Tao, Wei Wang 0011. 191-202 [doi]
- Online Pattern Matching for String Edit Distance with MovesYoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto. 203-214 [doi]
- K 2-Treaps: Range Top-k Queries in Compact SpaceNieves R. Brisaboa, Guillermo de Bernardo, Roberto Konow, Gonzalo Navarro. 215-226 [doi]
- Performance Improvements for Search Systems Using an Integrated Cache of Lists+IntersectionsGabriel Tolosa, Luca Becchetti, Esteban Feuerstein, Alberto Marchetti-Spaccamela. 227-235 [doi]
- Information-Theoretic Term Selection for New Item RecommendationThales F. Costa, Anísio Lacerda, Rodrygo L. T. Santos, Nivio Ziviani. 236-243 [doi]
- On the String Consensus Problem and the Manhattan Sequence Consensus ProblemTomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 244-255 [doi]
- Context-Aware Deal Size PredictionAnísio Lacerda, Adriano Veloso, Rodrygo L. T. Santos, Nivio Ziviani. 256-267 [doi]
- Simple and Efficient String Algorithms for Query Suggestion Metrics ComputationAlexander Loptev, Anna Selugina, Tatiana A. Starikovskaya. 268-278 [doi]