Volume 84, Issue 3

Search all Algorithmica articles

March 2022

Special Issue from London Stringology Days & London Algorithmic Workshop

Issue Editors:

Mai Alzamel,
Costas S Iliopoulos,
Dimitrios Letsios,
Nicola Prezza

11 articles in this issue

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
Part of 2 collections:

Special Issue from London Stringology Days & London Algorithmic Workshop

Special Issue from London Stringology Days & London Algorithmic Workshop
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
Aleksander Kędzierski
Jakub Radoszewski
OriginalPaper Open access 22 June 2021 Pages: 566 - 589
Part of 2 collections:

Special Issue from London Stringology Days & London Algorithmic Workshop

Special Issue from London Stringology Days & London Algorithmic Workshop
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges
Avivit Levy
B. Riva Shalom
OriginalPaper 06 July 2021 Pages: 590 - 638
Part of 2 collections:

Special Issue from London Stringology Days & London Algorithmic Workshop

Special Issue from London Stringology Days & London Algorithmic Workshop
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs
Lavinia Egidi
Felipe A. Louza
Giovanni Manzini
OriginalPaper 16 July 2021 Pages: 639 - 669
Part of 2 collections:

Special Issue from London Stringology Days & London Algorithmic Workshop

Special Issue from London Stringology Days & London Algorithmic Workshop
Computing Minimal Unique Substrings for a Sliding Window
Takuya Mieno
Yuta Fujishige
Masayuki Takeda
OriginalPaper Open access 20 August 2021 Pages: 670 - 693
Part of 2 collections:

Special Issue from London Stringology Days & London Algorithmic Workshop

Special Issue from London Stringology Days & London Algorithmic Workshop
Adaptive Succinctness
Diego Arroyuelo
Rajeev Raman
OriginalPaper 04 October 2021 Pages: 694 - 718
Part of 2 collections:

Special Issue from London Stringology Days & London Algorithmic Workshop

Special Issue from London Stringology Days & London Algorithmic Workshop
Safety in s-t Paths, Trails and Walks
Massimo Cairo
Shahbaz Khan
Alexandru I. Tomescu
OriginalPaper Open access 13 October 2021 Pages: 719 - 741
Part of 2 collections:

Special Issue from London Stringology Days & London Algorithmic Workshop

Special Issue from London Stringology Days & London Algorithmic Workshop
Computing The Maximum Exponent in a Stream
Oleg Merkurev
Arseny M. Shur
OriginalPaper 03 November 2021 Pages: 742 - 756
Part of 2 collections:

Special Issue from London Stringology Days & London Algorithmic Workshop

Special Issue from London Stringology Days & London Algorithmic Workshop
Enumeration of Maximal Common Subsequences Between Two Strings
Alessio Conte
Roberto Grossi
Takeaki Uno
OriginalPaper 12 January 2022 Pages: 757 - 783
Part of 2 collections:

Special Issue from London Stringology Days & London Algorithmic Workshop

Special Issue from London Stringology Days & London Algorithmic Workshop
On the Complexity of Recognizing Wheeler Graphs
Daniel Gibney
Sharma V. Thankachan
OriginalPaper 10 January 2022 Pages: 784 - 814
Part of 2 collections:

Special Issue from London Stringology Days & London Algorithmic Workshop

Special Issue from London Stringology Days & London Algorithmic Workshop
An Axiomatic Approach to Time-Dependent Shortest Path Oracles
Spyros Kontogiannis
Dorothea Wagner
Christos Zaroliagis
OriginalPaper 24 January 2022 Pages: 815 - 870
Part of 2 collections:

Special Issue from London Stringology Days & London Algorithmic Workshop

Special Issue from London Stringology Days & London Algorithmic Workshop

Volume 84, Issue 3

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

k-Approximate Quasiperiodicity Under Hamming and Edit Distance

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

Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs

Computing Minimal Unique Substrings for a Sliding Window

Adaptive Succinctness

Safety in s-t Paths, Trails and Walks

Computing The Maximum Exponent in a Stream

Enumeration of Maximal Common Subsequences Between Two Strings

On the Complexity of Recognizing Wheeler Graphs

An Axiomatic Approach to Time-Dependent Shortest Path Oracles

Navigation