Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
RECOMB
/
Paper
The String Barcoding Problem is NP-Hard.
Marcello Dalpasso
,
Giuseppe Lancia
,
Romeo Rizzi
Venue
B
RECOMB
Year
2005
Proceedings
Comparative Genomics
DBLP record
conf/recomb/DalpassoLR05 ↗
Browse the full
RECOMB paper archive
.