Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
RECOMB
/
Paper
The Complexity of Approximate Pattern Matching on de Bruijn Graphs.
Daniel Gibney
,
Sharma V. Thankachan
,
Srinivas Aluru
Venue
B
RECOMB
Year
2022
Proceedings
RECOMB
DBLP record
conf/recomb/GibneyTA22 ↗
Browse the full
RECOMB paper archive
.