[HTML][HTML] Absence of a simple code: how transcription factors read the genome

M Slattery, T Zhou, L Yang, ACD Machado… - Trends in biochemical …, 2014 - cell.com
Transcription factors (TFs) influence cell fate by interpreting the regulatory DNA within a
genome. TFs recognize DNA in a specific manner; the mechanisms underlying this …

A survey of DNA motif finding algorithms

MK Das, HK Dai - BMC bioinformatics, 2007 - Springer
Background Unraveling the mechanisms that regulate gene expression is a major challenge
in biology. An important task in this challenge is to identify regulatory elements, especially …

MEME: discovering and analyzing DNA and protein sequence motifs

TL Bailey, N Williams, C Misleh, WW Li - Nucleic acids research, 2006 - academic.oup.com
Abstract MEME (Multiple EM for Motif Elicitation) is one of the most widely used tools for
searching for novel 'signals' in sets of biological sequences. Applications include the …

Assessing computational tools for the discovery of transcription factor binding sites

M Tompa, N Li, TL Bailey, GM Church, B De Moor… - Nature …, 2005 - nature.com
The prediction of regulatory elements is a problem where computational methods offer great
hope. Over the past few years, numerous tools have become available for this task. The …

[PDF][PDF] Finding motifs in time series

J Lonardi, P Patel - Proc. of the 2nd workshop on temporal …, 2002 - sfb876.tu-dortmund.de
The problem of efficiently locating previously known patterns in a time series database (ie,
query by content) has received much attention and may now largely be regarded as a …

Probabilistic discovery of time series motifs

B Chiu, E Keogh, S Lonardi - Proceedings of the ninth ACM SIGKDD …, 2003 - dl.acm.org
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 …

[КНИГА][B] Handbook of approximation algorithms and metaheuristics

TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

A nearly tight sum-of-squares lower bound for the planted clique problem

B Barak, S Hopkins, J Kelner, PK Kothari, A Moitra… - SIAM Journal on …, 2019 - SIAM
We prove that with high probability over the choice of a random graph G from the Erdös--
Rényi distribution G(n,1/2), the n^O(d)-time degree d sum-of-squares (SOS) semidefinite …

[КНИГА][B] Temporal data mining

T Mitsa - 2010 - taylorfrancis.com
From basic data mining concepts to state-of-the-art advances, this book covers the theory of
the subject as well as its application in a variety of fields. It discusses the incorporation of …

Finding motifs using random projections

J Buhler, M Tompa - Proceedings of the fifth annual international …, 2001 - dl.acm.org
Pevzner and Sze [23] considered a precise version of the motif discovery problem and
simultaneously issued an algorithmic challenge: find a motif M of length 15, where each …