10 citations · 11 across the 3 of their papers we have counts for
4 papers · 1 filter
Average-Case and Smoothed Near-Optimality for Color-Code Decoding
Daniel Gibney, Jackson Huffstutler
Minimum-weight decoding for two-dimensional color codes is NP-hard (Walters and Turner 2026), motivating the search for approximation guarantees beyond worst-case exact decoding. W…
Contextual Pattern Mining and Counting
Ling Li, Daniel Gibney, Sharma V. Thankachan +2
Given a string of length , a longer string of length , and two integers and , the context of in is the set of all string pairs , w…
The Complexity of Approximate Pattern Matching on De Bruijn Graphs
Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru
Aligning a sequence to a walk in a labeled graph is a problem of fundamental importance to Computational Biology. For finding a walk in an arbitrary graph with edges that exa…
On the Complexity of BWT-runs Minimization via Alphabet Reordering
Jason Bentley, Daniel Gibney, Sharma V. Thankachan
The Burrows-Wheeler Transform (BWT) has been an essential tool in text compression and indexing. First introduced in 1994, it went on to provide the backbone for the first encoding…