Daniel Gibney

Orcid: 0000-0003-1493-5432

According to our database1, Daniel Gibney authored at least 25 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Compressibility-Aware Quantum Algorithms on Strings.
CoRR, 2023

Non-overlapping Indexing in BWT-Runs Bounded Space.
Proceedings of the String Processing and Information Retrieval, 2023

Contextual Pattern Matching in Less Space.
Proceedings of the Data Compression Conference, 2023

2022
Algorithms for Colinear Chaining with Overlaps and Gap Costs.
J. Comput. Biol., 2022

On the Hardness of Sequence Alignment on De Bruijn Graphs.
J. Comput. Biol., 2022

On the Complexity of Recognizing Wheeler Graphs.
Algorithmica, 2022

Feasibility of Flow Decomposition with Subpath Constraints in Linear Time.
Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022

Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs.
Proceedings of the String Processing and Information Retrieval, 2022

Co-linear Chaining with Overlaps and Gap Costs.
Proceedings of the Research in Computational Molecular Biology, 2022

The Complexity of Approximate Pattern Matching on de Bruijn Graphs.
Proceedings of the Research in Computational Molecular Biology, 2022

Haplotype-aware variant selection for genome graphs.
Proceedings of the BCB '22: 13th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, Northbrook, Illinois, USA, August 7, 2022

2021
I/O-optimal categorical 3-sided skyline queries.
Theor. Comput. Sci., 2021

Text Indexing for Regular Expression Matching.
Algorithms, 2021

Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

2020
Quantifying Membership Inference Vulnerability via Generalization Gap and Other Model Metrics.
CoRR, 2020

An Efficient Elastic-Degenerate Text Index? Not Likely.
Proceedings of the String Processing and Information Retrieval, 2020

The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

On the Complexity of BWT-Runs Minimization via Alphabet Reordering.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

FM-Index Reveals the Reverse Suffix Array.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
On the Hardness and Inapproximability of Recognizing Wheeler Graphs.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

I/O Optimal Data Structures for Categorical Range Skyline Queries.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Faster Computation of Genome Mappability with one Mismatch.
Proceedings of the 8th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2018

Faster Computation of Genome Mappability.
Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018


  Loading...