Follow
Daniel J Gibney
Title
Cited by
Cited by
Year
On the hardness and inapproximability of recognizing wheeler graphs
D Gibney, SV Thankachan
arXiv preprint arXiv:1902.01960, 2019
272019
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism∗
D Gibney, G Hoppenworth, S V. Thankachan
Symposium on Simplicity in Algorithms (SOSA), 232-242, 2021
152021
On the complexity of BWT-runs minimization via alphabet reordering
J Bentley, D Gibney, SV Thankachan
arXiv preprint arXiv:1911.03035, 2019
152019
An efficient elastic-degenerate text index? not likely
D Gibney
International Symposium on String Processing and Information Retrieval, 76-88, 2020
92020
The fine-grained complexity of median and center string problems under edit distance
G Hoppenworth, JW Bentley, D Gibney, S V Thankachan
28th Annual European Symposium on Algorithms, ESA 2020, 2020
72020
Co-linear chaining with overlaps and gap costs
C Jain, D Gibney, SV Thankachan
International Conference on Research in Computational Molecular Biology, 246-262, 2022
52022
Finding an optimal alphabet ordering for Lyndon factorization is hard
D Gibney, SV Thankachan
38th International Symposium on Theoretical Aspects of Computer Science …, 2021
52021
Faster computation of genome mappability
S Hooshmand, P Abedin, D Gibney, S Aluru, SV Thankachan
Proceedings of the 2018 ACM International Conference on Bioinformatics …, 2018
52018
Text Indexing for Regular Expression Matching
D Gibney, SV Thankachan
Algorithms 14 (5), 133, 2021
42021
FM-index reveals the reverse suffix array
A Ganguly, D Gibney, S Hooshmand, MO Kulekci, SV Thankachan
31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, 2020
42020
Faster Computation of Genome Mappability with one Mismatch.
S Hooshmand, P Abedin, D Gibney, S Aluru, SV Thankachan
ICCABS, 1, 2018
22018
On the Complexity of Recognizing Wheeler Graphs
D Gibney, SV Thankachan
Algorithmica 84 (3), 784-814, 2022
12022
Quantifying Membership Inference Vulnerability via Generalization Gap and Other Model Metrics
JW Bentley, D Gibney, G Hoppenworth, SK Jha
arXiv preprint arXiv:2009.05669, 2020
12020
Wheeler Graph Recognition on 3-NFAs and 4-NFAs
D Gibney
Proceedings of the Open Problem Session, International Workshop on …, 2020
12020
Haplotype-aware variant selection for genome graphs
N Tavakoli, D Gibney, S Aluru
Proceedings of the 13th ACM International Conference on Bioinformatics …, 2022
2022
Feasibility of Flow Decomposition with Subpath Constraints in Linear Time
D Gibney, SV Thankachan, S Aluru
22nd International Workshop on Algorithms in Bioinformatics (WABI 2022), 2022
2022
The Complexity of Approximate Pattern Matching on de Bruijn Graphs
D Gibney, SV Thankachan, S Aluru
International Conference on Research in Computational Molecular Biology, 263-278, 2022
2022
I/O-optimal categorical 3-sided skyline queries
A Ganguly, D Gibney, SV Thankachan, R Shah
Theoretical Computer Science 896, 132-144, 2021
2021
Algorithms and Lower Bounds for Ordering Problems on Strings
D Gibney
2021
A Fine-Grained Reduction from k-Sized Witness Detection to Its Unique Solution Promise Version
P Darbari, D Gibney, G Hoppenworth, SV Thankachan
The system can't perform the operation now. Try again later.
Articles 1–20