Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees

von Kempa, Dominik
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 7 of 7 (2023)

Towards a Definitive Measure of Repetitiveness

von Kociumaka, Tomasz
Veröffentlicht in LATIN (14. : 2020 : Online) LATIN 2020: theoretical informatics (2020)

How Compression and Approximation Affect Efficiency in String Distance Measures

von Ganesh, Arun
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 4 of 5 (2022)

Computing Longest (Common) Lyndon Subsequences

von Bannai, Hideo
Veröffentlicht in IWOCA (33. : 2022 : Trier) Combinatorial algorithms (2022)

An Improved Algorithm for The k-Dyck Edit Distance Problem

von Fried, Dvir
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (2022 : Online) ACM-SIAM Symposium on Discrete Algorithms (SODA22) ; Volume 5 of 5 (2022)

Efficient Enumeration of Distinct Factors Using Package Representations

von Charalampopoulos, Panagiotis
Veröffentlicht in SPIRE (27. : 2020 : Orlando, Fla.; Online) String processing and information retrieval (2020)