Sciweavers

2192 search results - page 1 / 439
» Algorithms for Challenging Motif Problems
Sort
View
JBCB
2006
41views more  JBCB 2006»
13 years 11 months ago
Algorithms for Challenging Motif Problems
Henry C. M. Leung, Francis Y. L. Chin
BIBE
2006
IEEE
14 years 5 months ago
Extending Pattern Branching to Handle Challenging Instances
We consider the planted motif search problem, a problem that arises from the need to find transcription factor-binding sites in genomic information. One of the fastest non-exact a...
Jaime Davila, Sanguthevar Rajasekaran
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
14 years 2 months ago
Identification of weak motifs in multiple biological sequences using genetic algorithm
Recognition of motifs in multiple unaligned sequences provides an insight into protein structure and function. The task of discovering these motifs is very challenging because mos...
Topon Kumar Paul, Hitoshi Iba
RECOMB
2001
Springer
14 years 11 months ago
Finding motifs using random projections
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...
Jeremy Buhler, Martin Tompa
BMCBI
2007
190views more  BMCBI 2007»
13 years 11 months ago
Discriminative motif discovery in DNA and protein sequences using the DEME algorithm
Background: Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to i...
Emma Redhead, Timothy L. Bailey