Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CPM
/
Paper
Approximating Shortest Superstring Problem Using de Bruijn Graphs.
Alexander Golovnev
,
Alexander S. Kulikov
,
Ivan Mihajlin
Venue
B
CPM
Year
2013
Proceedings
CPM
DBLP record
conf/cpm/GolovnevKM13 ↗
Browse the full
CPM paper archive
.