default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Gibney
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Neda Tavakoli
, Daniel Gibney, Srinivas Aluru:
GraphSlimmer: Preserving Read Mappability with the Minimum Number of Variants. J. Comput. Biol. 31(7): 616-637 (2024)- [c22]Aranya Banerjee, Daniel Gibney, Sharma V. Thankachan:
Longest Common Substring with Gaps and Related Problems. ESA 2024: 16:1-16:18 - [c21]Ghanshyam Chandra, Daniel Gibney, Chirag Jain:
Haplotype-Aware Sequence Alignment to Pangenome Graphs. RECOMB 2024: 381-384 - [c20]Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan:
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. SODA 2024: 3302-3332 - [c19]Arnab Ganguly, Daniel Gibney, Paul Macnichol, Sharma V. Thankachan:
Bounded-Ratio Gapped String Indexing. SPIRE 2024: 118-126 - [c18]Daniel Gibney, Md. Helal Hossen:
Quantum Algorithms for Longest Common Substring with a Gap. SPIRE 2024: 143-158 - 2023
- [c17]Paniz Abedin, Oliver A. Chubet, Daniel Gibney, Sharma V. Thankachan:
Contextual Pattern Matching in Less Space. DCC 2023: 160-167 - [c16]Daniel Gibney, Paul Macnichol, Sharma V. Thankachan:
Non-overlapping Indexing in BWT-Runs Bounded Space. SPIRE 2023: 260-270 - [i7]Daniel Gibney, Sharma V. Thankachan:
Compressibility-Aware Quantum Algorithms on Strings. CoRR abs/2302.07235 (2023) - [i6]Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan:
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. CoRR abs/2311.01793 (2023) - 2022
- [j5]Daniel Gibney, Sharma V. Thankachan:
On the Complexity of Recognizing Wheeler Graphs. Algorithmica 84(3): 784-814 (2022) - [j4]Chirag Jain, Daniel Gibney, Sharma V. Thankachan:
Algorithms for Colinear Chaining with Overlaps and Gap Costs. J. Comput. Biol. 29(11): 1237-1251 (2022) - [j3]Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru:
On the Hardness of Sequence Alignment on De Bruijn Graphs. J. Comput. Biol. 29(12): 1377-1396 (2022) - [c15]Neda Tavakoli, Daniel Gibney, Srinivas Aluru:
Haplotype-aware variant selection for genome graphs. BCB 2022: 51:1-51:9 - [c14]Chirag Jain, Daniel Gibney, Sharma V. Thankachan:
Co-linear Chaining with Overlaps and Gap Costs. RECOMB 2022: 246-262 - [c13]Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru:
The Complexity of Approximate Pattern Matching on de Bruijn Graphs. RECOMB 2022: 263-278 - [c12]Parisa Darbari, Daniel Gibney, Sharma V. Thankachan:
Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs. SPIRE 2022: 303-314 - [c11]Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru:
Feasibility of Flow Decomposition with Subpath Constraints in Linear Time. WABI 2022: 17:1-17:16 - [i5]Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru:
The Complexity of Approximate Pattern Matching on De Bruijn Graphs. CoRR abs/2201.12454 (2022) - 2021
- [j2]Daniel Gibney, Sharma V. Thankachan:
Text Indexing for Regular Expression Matching. Algorithms 14(5): 133 (2021) - [j1]Arnab Ganguly, Daniel Gibney, Sharma V. Thankachan, Rahul Shah:
I/O-optimal categorical 3-sided skyline queries. Theor. Comput. Sci. 896: 132-144 (2021) - [c10]Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan:
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism. SOSA 2021: 232-242 - [c9]Daniel Gibney, Sharma V. Thankachan:
Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard. STACS 2021: 35:1-35:15 - 2020
- [c8]Arnab Ganguly, Daniel Gibney, Sahar Hooshmand, M. Oguzhan Külekci, Sharma V. Thankachan:
FM-Index Reveals the Reverse Suffix Array. CPM 2020: 13:1-13:14 - [c7]Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan:
On the Complexity of BWT-Runs Minimization via Alphabet Reordering. ESA 2020: 15:1-15:13 - [c6]Gary Hoppenworth, Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan:
The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance. ESA 2020: 61:1-61:19 - [c5]Daniel Gibney:
An Efficient Elastic-Degenerate Text Index? Not Likely. SPIRE 2020: 76-88 - [i4]Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan:
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism. CoRR abs/2008.11786 (2020) - [i3]Jason W. Bentley, Daniel Gibney, Gary Hoppenworth, Sumit Kumar Jha:
Quantifying Membership Inference Vulnerability via Generalization Gap and Other Model Metrics. CoRR abs/2009.05669 (2020)
2010 – 2019
- 2019
- [c4]Daniel Gibney, Sharma V. Thankachan, Arnab Ganguly, Rahul Shah:
I/O Optimal Data Structures for Categorical Range Skyline Queries. CCCG 2019: 9-16 - [c3]Daniel Gibney, Sharma V. Thankachan:
On the Hardness and Inapproximability of Recognizing Wheeler Graphs. ESA 2019: 51:1-51:16 - [i2]Daniel Gibney, Sharma V. Thankachan:
On the Hardness and Inapproximability of Recognizing Wheeler Graphs. CoRR abs/1902.01960 (2019) - [i1]Jason W. Bentley, Daniel Gibney, Sharma V. Thankachan:
On the Complexity of BWT-runs Minimization via Alphabet Reordering. CoRR abs/1911.03035 (2019) - 2018
- [c2]Sahar Hooshmand, Paniz Abedin, Daniel Gibney, Srinivas Aluru, Sharma V. Thankachan:
Faster Computation of Genome Mappability. BCB 2018: 537 - [c1]Sahar Hooshmand, Paniz Abedin, Daniel Gibney, Srinivas Aluru, Sharma V. Thankachan:
Faster Computation of Genome Mappability with one Mismatch. ICCABS 2018: 1
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
