About Me
I'm an Assistant Professor in The Department of Computer Science at The University of Texas at Dallas.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. Following my Ph.D., I received two years of postdoctoral experience at The Georgia Institute of Technology under the supervision of Srinivas Aluru.
My research interests include:
- Bioinformatics / Computational biology
- Algorithm design and analysis
- Computational complexity
- Quantum algorithms
News
I am currently looking for students to join my lab. Interested folks are welcome to contact me. See publications to learn about our work.Contact
- Office location: ECSS 4.706
- Email: daniel.gibney@utdallas.edu
Teaching
- Fall 2023: CS 4349.006 Advance Algorithm Design & Analysis
- Spring 2024: CS 6301 Special topics - Quantum Computing
Select Publications
Please refer to my dblp and Google Scholar for a complete list.-
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization
Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan. (Accepted) SODA 2024 - Co-linear Chaining with Overlaps and Gap Costs Chirag Jain, Daniel Gibney, Sharma V. Thankachan. RECOMB 2022
- The Complexity of Approximate Pattern Matching on De Bruijn Graphs Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru. RECOMB 2022
- 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 Complexity of Recognizing Wheeler Graphs Daniel Gibney, Sharma V. Thankachan. Algorithmica 2022