| On the hardness and inapproximability of recognizing wheeler graphs D Gibney, SV Thankachan arXiv preprint arXiv:1902.01960, 2019 | 35 | 2019 |
| On the complexity of BWT-runs minimization via alphabet reordering J Bentley, D Gibney, SV Thankachan arXiv preprint arXiv:1911.03035, 2019 | 22 | 2019 |
| 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 | 21 | 2021 |
| 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 | 16 | 2022 |
| 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 | 15 | 2020 |
| An efficient elastic-degenerate text index? not likely D Gibney International Symposium on String Processing and Information Retrieval, 76-88, 2020 | 14 | 2020 |
| 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 | 11 | 2020 |
| Text indexing for regular expression matching D Gibney, SV Thankachan Algorithms 14 (5), 133, 2021 | 10 | 2021 |
| On the complexity of recognizing wheeler graphs D Gibney, SV Thankachan Algorithmica 84 (3), 784-814, 2022 | 6 | 2022 |
| Finding an optimal alphabet ordering for Lyndon factorization is hard D Gibney, SV Thankachan 38th International Symposium on Theoretical Aspects of Computer Science …, 2021 | 6 | 2021 |
| 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 | 6 | 2020 |
| 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 | 5 | 2022 |
| 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 | 5 | 2018 |
| On the hardness of sequence alignment on de Bruijn graphs D Gibney, SV Thankachan, S Aluru Journal of Computational Biology 29 (12), 1377-1396, 2022 | 4 | 2022 |
| Quantum time complexity and algorithms for pattern matching on labeled graphs P Darbari, D Gibney, SV Thankachan International Symposium on String Processing and Information Retrieval, 303-314, 2022 | 4 | 2022 |
| Algorithms for colinear chaining with overlaps and gap costs C Jain, D Gibney, SV Thankachan Journal of Computational Biology 29 (11), 1237-1251, 2022 | 2 | 2022 |
| Haplotype-aware variant selection for genome graphs N Tavakoli, D Gibney, S Aluru Proceedings of the 13th ACM International Conference on Bioinformatics …, 2022 | 2 | 2022 |
| Faster Computation of Genome Mappability with one Mismatch. S Hooshmand, P Abedin, D Gibney, S Aluru, SV Thankachan ICCABS, 1, 2018 | 2 | 2018 |
| Compressibility-Aware Quantum Algorithms on Strings D Gibney, SV Thankachan arXiv preprint arXiv:2302.07235, 2023 | 1 | 2023 |
| Feasibility of flow decomposition with subpath constraints in linear time D Gibney, V Sharma, S Aluru 22nd International Workshop on Algorithms in Bioinformatics, Leibniz …, 2022 | 1 | 2022 |
Sharma V. ThankachanNorth Carolina State UniversityVerified email at ncsu.edu
