362 search results - page 4 / 73 » Finding Motifs with Gaps |
RECOMB
2004
Springer
15 years 11 months ago
2004
Springer
77
Voted
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
155
click to vote
RECOMB
2001
Springer
15 years 11 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
BMCBI
2007
14 years 11 months ago
2007
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
RECOMB
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...