Sciweavers

Share
RECOMB
2004
Springer

From profiles to patterns and back again: a branch and bound algorithm for finding near optimal motif profiles

9 years 10 months ago
From profiles to patterns and back again: a branch and bound algorithm for finding near optimal motif profiles
Eleazar Eskin
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2004
Where RECOMB
Authors Eleazar Eskin
Comments (0)
books