Abstract is missing.
- The Nearest Colored Node in a TreePawel Gawrychowski, Gad M. Landau, Shay Mozes, Oren Weimann. [doi]
- Deterministic Sub-Linear Space LCE Data Structures With Efficient ConstructionYuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda. [doi]
- Encoding Two-Dimensional Range Top-k QueriesSeungbum Jo, Rahul Lingala, Srinivasa Rao Satti. [doi]
- Reconstruction of Trees from Jumbled and Weighted SubtreesDénes Bartha, Peter Burcsi, Zsuzsanna Lipták. [doi]
- Finding Maximal 2-Dimensional PalindromesSara Geizhals, Dina Sokol. [doi]
- Faster Longest Common Extension Queries in Strings over General AlphabetsPawel Gawrychowski, Tomasz Kociumaka, Wojciech Rytter, Tomasz Walen. [doi]
- Front Matter, Table of Contents, Preface [doi]
- Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in StreamsPawel Gawrychowski, Oleg Merkurev, Arseny Shur, Przemyslaw Uznanski. [doi]
- Estimating Statistics on Words Using Ambiguous DescriptionsCyril Nicaud. [doi]
- Longest Common Substring with Approximately k MismatchesTatiana A. Starikovskaya. [doi]
- Hardness of RNA Folding Problem With Four SymbolsYi-Jun Chang. [doi]
- Minimal Suffix and Rotation of a Substring in Optimal TimeTomasz Kociumaka. [doi]
- Linear-time Suffix Sorting - A New Approach for Suffix Array ConstructionUwe Baier. [doi]
- Graph Motif Problems Parameterized by DualGuillaume Fertin, Christian Komusiewicz. [doi]
- Color-Distance Oracles and SnippetsTsvi Kopelowitz, Robert Krauthgamer. [doi]
- Optimal Prefix Free Codes with Partial SortingJérémy Barbay. [doi]
- A Linear-Time Algorithm for the Copy Number Transformation ProblemRon Shamir, Meirav Zehavi, Ron Zeira. [doi]
- Efficient Non-Binary Gene Tree Resolution with Weighted Reconciliation CostManuel Lafond, Emmanuel Noutahi, Nadia El-Mabrouk. [doi]
- Efficient Index for Weighted SequencesCarl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski. [doi]
- Factorizing a String into Squares in Linear TimeYoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea. [doi]
- On the Benefit of Merging Suffix Array Intervals for Parallel Pattern MatchingJohannes Fischer 0001, Dominik Köppl, Florian Kurpicz. [doi]
- A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping ProblemNicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, Paolo Pasini, Stefano Quer. [doi]
- Genomic Scaffold Filling RevisitedHaitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu, Binhai Zhu. [doi]
- Space-Efficient Dictionaries for Parameterized and Order-Preserving Pattern MatchingArnab Ganguly 0002, Wing-Kai Hon, Kunihiko Sadakane, Rahul Shah, Sharma V. Thankachan, Yilin Yang. [doi]
- Fast Compatibility Testing for Rooted Phylogenetic TreesYu Deng, David Fernández-Baca. [doi]
- Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with UncertaintiesCostas S. Iliopoulos, Jakub Radoszewski. [doi]
- Fully-online Construction of Suffix Trees for Multiple TextsTakuya Takagi, Shunsuke Inenaga, Hiroki Arimura. [doi]
- Succinct Online Dictionary Matching with Improved Worst-Case GuaranteesTsvi Kopelowitz, Ely Porat, Yaron Rozen. [doi]
- Boxed Permutation Pattern MatchingMika Amit, Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Hjalte Wedel Vildhøj. [doi]
- On Almost Monge All Scores MatricesAmir Carmel, Dekel Tsur, Michal Ziv-Ukelson. [doi]