Daniel Gibney

Available identifiers

Publication	Date of Publication	Type
Near-optimal quantum algorithms for bounded edit distance and Lempel-Ziv factorization	2024-11-28	Paper
Feasibility of flow decomposition with subpath constraints in linear time	2024-08-13	Paper
Non-overlapping indexing in BWT-runs bounded space	2024-05-29	Paper
Simple reductions from formula-SAT to pattern matching on labeled graphs and subtree isomorphism	2024-05-14	Paper
Quantum time complexity and algorithms for pattern matching on labeled graphs	2023-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5874481	2023-02-07	Paper
The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5874441	2023-02-07	Paper
An Efficient Elastic-Degenerate Text Index? Not Likely	2022-12-22	Paper
Co-linear chaining with overlaps and gap costs	2022-08-30	Paper
The complexity of approximate pattern matching on de Bruijn graphs	2022-08-30	Paper
On the Hardness and Inapproximability of Recognizing Wheeler Graphs	2022-05-11	Paper
On the complexity of recognizing Wheeler graphs	2022-03-22	Paper
I/O-optimal categorical 3-sided skyline queries	2021-11-18	Paper

This page was built for person: Daniel Gibney