Daniel Gibney

Postdoc at Georgia Tech Institute for Data Engineering and Science (IDEaS)
Advisor: Srinivas Aluru

My main area of research is algorithms for problems in bioinformatics. I received my Ph.D. in Computer Science at the University of Central Florida under the supervision of Sharma V. Thankachan, where I focused on string algorithms and related problems in computational complexity. I also obtained an MSc in Mathematics and BSc in Computer Engineering from the University of Central Florida.

Here are links to my dblp and Google Scholar.

Research Interests

• Bioinformatics / computational biology
• Algorithm design and analysis
• Computational complexity

Select Publications

• The Complexity of Approximate Pattern Matching on De Bruijn Graphs
  Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru. RECOMB 2022 (accepted)
• Co-linear Chaining with Overlaps and Gap Costs
  Chirag Jain, Daniel Gibney, Sharma V. Thankachan. RECOMB 2022 (accepted)
• Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism
  Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan. SOSA 2021
• Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard
  Daniel Gibney, Sharma V. Thankachan. STACS 2021
• On the Complexity of BWT-Runs Minimization via Alphabet Reordering
  Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan. ESA 2020
• The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance
  Gary Hoppenworth, Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan. ESA 2020
• On the Hardness and Inapproximability of Recognizing Wheeler Graphs
  Daniel Gibney, Sharma V. Thankachan. ESA 2019