Abstract is missing.
- Disorders and PermutationsLaurent Bulteau, Samuele Giraudo, Stéphane Vialette. [doi]
- Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds DistanceKeegan Yao, Mukul S. Bansal. [doi]
- A Linear Time Algorithm for Constructing Hierarchical Overlap GraphsSangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park, Eric Rivals. [doi]
- Internal Shortest Absent Word QueriesGolnaz Badkobeh, Panagiotis Charalampopoulos, Solon P. Pissis. [doi]
- Efficient Algorithms for Counting Gapped PalindromesAndrei Popa, Alexandru Popa 0001. [doi]
- Repetitions in Strings: A "Constant" Problem (Invited Talk)Hideo Bannai. [doi]
- Data Structures for Categorical Path Counting QueriesMeng He 0001, Serikzhan Kazi. [doi]
- String Sanitization Under Edit Distance: Improved and GeneralizedTakuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering. [doi]
- AWLCO: All-Window Length Co-OccurrenceJoshua Sobel, Noah Bertram, Chen Ding 0001, Fatemeh Nargesian, Daniel Gildea. [doi]
- Weighted Ancestors in Suffix Trees RevisitedDjamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman. [doi]
- Constructing Strings Avoiding Forbidden SubstringsGiulia Bernardini 0001, Alberto Marchetti-Spaccamela, Solon P. Pissis, Leen Stougie, Michelle Sweering. [doi]
- The Longest Run Subsequence Problem: Further Complexity ResultsRiccardo Dondi, Florian Sikora. [doi]
- Computing Edit Distance (Invited Talk)Michal Koucký 0001. [doi]
- Computing Covers of 2D-StringsPanagiotis Charalampopoulos, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba. [doi]
- A Compact Index for Cartesian Tree MatchingSung-Hwan Kim, Hwan-Gue Cho. [doi]
- An Invertible Transform for Efficient String Matching in Labeled DigraphsAbhinav Nellore, Austin Nguyen, Reid F. Thompson. [doi]
- Ranking Bracelets in Polynomial TimeDuncan Adamson, Vladimir V. Gusev, Igor Potapov, Argyrios Deligkas. [doi]
- R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded SpaceTakaaki Nishimoto, Yasuo Tabei. [doi]
- On-Line Pattern Matching on D-Texts (Invited Talk)Nadia Pisanti. [doi]
- Compressed Weighted de Bruijn GraphsGiuseppe F. Italiano, Nicola Prezza, Blerina Sinaimeri, Rossano Venturini. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Optimal Construction of Hierarchical Overlap GraphsShahbaz Khan 0004. [doi]
- Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear TimeHideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski. [doi]
- The k-Mappability Problem RevisitedAmihood Amir, Itai Boneh, Eitan Kondratovsky. [doi]
- A Fast and Small Subsampled R-IndexDustin Cobas, Travis Gagie, Gonzalo Navarro. [doi]
- Gapped Indexing for Consecutive OccurrencesPhilip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner. [doi]