Sciweavers

58
Voted
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 18 days ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...