Sciweavers

179 search results - page 7 / 36
» Analysis of computational approaches for motif discovery
Sort
View
BMCBI
2006
145views more  BMCBI 2006»
14 years 9 months ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...
BMCBI
2010
108views more  BMCBI 2010»
14 years 9 months ago
An intuitionistic approach to scoring DNA sequences against transcription factor binding site motifs
Background: Transcription factors (TFs) control transcription by binding to specific regions of DNA called transcription factor binding sites (TFBSs). The identification of TFBSs ...
Fernando Garcia-Alcalde, Armando Blanco, Adrian J....
RECOMB
2008
Springer
15 years 9 months ago
A Fast, Alignment-Free, Conservation-Based Method for Transcription Factor Binding Site Discovery
As an increasing number of eukaryotic genomes are being sequenced, comparative studies aimed at detecting regulatory elements in intergenic sequences are becoming more prevalent. M...
Raluca Gordân, Leelavati Narlikar, Alexander...
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
15 years 3 months ago
A Faster Algorithm for Detecting Network Motifs
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
Sebastian Wernicke
BMCBI
2008
123views more  BMCBI 2008»
14 years 9 months ago
Pol II promoter prediction using characteristic 4-mer motifs: a machine learning approach
Background: Eukaryotic promoter prediction using computational analysis techniques is one of the most difficult jobs in computational genomics that is essential for constructing a...
Firoz Anwar, Syed Murtuza Baker, Taskeed Jabid, Md...