Scholar
Daniel Gibney
Google Scholar ID: v2h8F4YAAAAJ
University of Texas at Dallas
Citations & Impact
Citations
326
H-index
11
i10-index
13
Publications
20
Co-authors
12
list available
Contact
No contact links provided.
Publications
Resume (English only)
Academic Achievements
- Publications:
- - Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization (SODA 2024)
- - Co-linear Chaining with Overlaps and Gap Costs (RECOMB 2022)
- - The Complexity of Approximate Pattern Matching on De Bruijn Graphs (RECOMB 2022)
- - Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism (SOSA 2021)
- - Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard (STACS 2021)
- - On the Complexity of BWT-Runs Minimization via Alphabet Reordering (ESA 2020)
- - The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (ESA 2020)
- - On the Complexity of Recognizing Wheeler Graphs (Algorithmica 2022)
Research Experience
- Currently an Assistant Professor in the Department of Computer Science at The University of Texas at Dallas. Conducted research on string algorithms and related problems in computational complexity at The University of Central Florida, followed by two years of postdoctoral research at The Georgia Institute of Technology.
Education
- Ph.D. in Computer Science from The University of Central Florida under the supervision of Sharma V. Thankachan; Postdoctoral experience at The Georgia Institute of Technology under the supervision of Srinivas Aluru.
Background
- Research interests include: Bioinformatics / Computational biology, Algorithm design and analysis, Computational complexity, Quantum algorithms. Currently an Assistant Professor in the Department of Computer Science at The University of Texas at Dallas.
Miscellany
- Currently looking for students to join his lab. Office location: ECSS 4.706. Email: daniel.gibney@utdallas.edu.
