Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CPM
/
Paper
A Polynominal Time Approximation Scheme for the Closest Substring Problem.
Bin Ma
Venue
B
CPM
Year
2000
Proceedings
CPM
DBLP record
conf/cpm/Ma00 ↗
Browse the full
CPM paper archive
.