Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
RECOMB
/
Paper
From profiles to patterns and back again: a branch and bound algorithm for finding near optimal motif profiles.
Eleazar Eskin
Venue
B
RECOMB
Year
2004
Proceedings
RECOMB
DBLP record
conf/recomb/Eskin04 ↗
Browse the full
RECOMB paper archive
.