Sciweavers

2192 search results - page 2 / 439
» Algorithms for Challenging Motif Problems
Sort
View
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 10 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
BMCBI
2010
86views more  BMCBI 2010»
13 years 8 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
CPM
2007
Springer
222views Combinatorics» more  CPM 2007»
14 years 2 months ago
Computing Exact p-Value for Structured Motif
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
Jing Zhang, Xi Chen, Ming Li
BMCBI
2010
153views more  BMCBI 2010»
13 years 8 months ago
Metamotifs - a generative model for building families of nucleotide position weight matrices
Background: Development of high-throughput methods for measuring DNA interactions of transcription factors together with computational advances in short motif inference algorithms...
Matias Piipari, Thomas A. Down, Tim J. P. Hubbard
IJDMB
2006
90views more  IJDMB 2006»
13 years 8 months ago
An efficient motif discovery algorithm with unknown motif length and number of binding sites
: Most motif discovery algorithms from DNA sequences require the motif's length as input. Styczynski et al. introduced the Extended (l,d)-Motif Problem (EMP) where the motif&#...
Henry C. M. Leung, Francis Y. L. Chin