Sciweavers

2192 search results - page 6 / 439
» Algorithms for Challenging Motif Problems
Sort
View
BMCBI
2006
103views more  BMCBI 2006»
13 years 8 months ago
Cis-motifs upstream of the transcription and translation initiation sites are effectively revealed by their positional disequili
Background: The discovery of cis-regulatory motifs still remains a challenging task even though the number of sequenced genomes is constantly growing. Computational analyses using...
Kenneth W. Berendzen, Kurt Stüber, Klaus Hart...
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
14 years 8 months ago
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
Bill Yuan-chi Chiu, Eamonn J. Keogh, Stefano Lonar...
WABI
2005
Springer
143views Bioinformatics» more  WABI 2005»
14 years 1 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
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
13 years 11 months 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...
ICDM
2009
IEEE
121views Data Mining» more  ICDM 2009»
14 years 2 months ago
Finding Time Series Motifs in Disk-Resident Data
—Time series motifs are sets of very similar subsequences of a long time series. They are of interest in their own right, and are also used as inputs in several higher-level data...
Abdullah Mueen, Eamonn J. Keogh, Nima Bigdely Sham...