Special Issue from London Stringology Days & London Algorithmic Workshop

-

Journal

Algorithmica

Algorithmica is an international journal which publishes theoretical papers on algorithms that address problems arising in practical areas, and experimental papers of general appeal...

Mai Alzamel

-
Costas Iliopoulos

-
Dimitrios Letsios

-
Nicola Prezza

-

Showing 1-12 of 12 articles

Fast and Simple Compact Hashing via Bucketing
Dominik Köppl
Simon J. Puglisi
Rajeev Raman
OriginalPaper Open access 29 June 2022 Pages: 2735 - 2766
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW)
Mai Alzamel
Costas S. Iliopoulos
Nicola Prezza
Guest Editorial 01 February 2022 Pages: 565 - 565
An Axiomatic Approach to Time-Dependent Shortest Path Oracles
Spyros Kontogiannis
Dorothea Wagner
Christos Zaroliagis
OriginalPaper 24 January 2022 Pages: 815 - 870
Enumeration of Maximal Common Subsequences Between Two Strings
Alessio Conte
Roberto Grossi
Takeaki Uno
OriginalPaper 12 January 2022 Pages: 757 - 783
On the Complexity of Recognizing Wheeler Graphs
Daniel Gibney
Sharma V. Thankachan
OriginalPaper 10 January 2022 Pages: 784 - 814
Computing The Maximum Exponent in a Stream
Oleg Merkurev
Arseny M. Shur
OriginalPaper 03 November 2021 Pages: 742 - 756
Safety in s-t Paths, Trails and Walks
Massimo Cairo
Shahbaz Khan
Alexandru I. Tomescu
OriginalPaper Open access 13 October 2021 Pages: 719 - 741
Adaptive Succinctness
Diego Arroyuelo
Rajeev Raman
OriginalPaper 04 October 2021 Pages: 694 - 718
Computing Minimal Unique Substrings for a Sliding Window
Takuya Mieno
Yuta Fujishige
Masayuki Takeda
OriginalPaper Open access 20 August 2021 Pages: 670 - 693
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs
Lavinia Egidi
Felipe A. Louza
Giovanni Manzini
OriginalPaper 16 July 2021 Pages: 639 - 669
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges
Avivit Levy
B. Riva Shalom
OriginalPaper 06 July 2021 Pages: 590 - 638
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
Aleksander Kędzierski
Jakub Radoszewski
OriginalPaper Open access 22 June 2021 Pages: 566 - 589

Special Issue from London Stringology Days & London Algorithmic Workshop

Participating journal

Algorithmica

Editors

Mai Alzamel

Costas Iliopoulos

Dimitrios Letsios

Nicola Prezza

Articles

Fast and Simple Compact Hashing via Bucketing

Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW)

An Axiomatic Approach to Time-Dependent Shortest Path Oracles

Enumeration of Maximal Common Subsequences Between Two Strings

On the Complexity of Recognizing Wheeler Graphs

Computing The Maximum Exponent in a Stream

Safety in s-t Paths, Trails and Walks

Adaptive Succinctness

Computing Minimal Unique Substrings for a Sliding Window

Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs

A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges

k-Approximate Quasiperiodicity Under Hamming and Edit Distance