In silico representation and discovery of transcription factor binding sites

G Pavesi, G Mauri, G Pesole - Briefings in bioinformatics, 2004 - academic.oup.com
Understanding the complex mechanisms governing basic biological processes requires the
characterisation of regulatory motifs modulating gene expression at transcriptional and …

A Gibbs sampler for identification of symmetrically structured, spaced DNA motifs with improved estimation of the signal length

AV Favorov, MS Gelfand, AV Gerasimova… - …, 2005 - academic.oup.com
Motivation: Transcription regulatory protein factors often bind DNA as homo-dimers or hetero-
dimers. Thus they recognize structured DNA motifs that are inverted or direct repeats or …

[图书][B] DNA, words and models: statistics of exceptional words

S Robin, F Rodolphe, S Schbath - 2005 - books.google.com
Introduction. The context--Randomness and models--A bit of biology--Simple models for
biological sequences. Why a model?--Permutation model--Bernoulli model--Introduction to …

Mining statistically significant sequential patterns

C Low-Kam, C Raïssi, M Kaytoue… - 2013 IEEE 13th …, 2013 - ieeexplore.ieee.org
Recent developments in the frequent pattern mining framework uses additional measures of
interest to reduce the set of discovered patterns. We introduce a rigorous and efficient …

Pattern Markov chains: optimal Markov chain embedding through deterministic finite automata

G Nuel - Journal of Applied Probability, 2008 - cambridge.org
In the framework of patterns in random texts, the Markov chain embedding techniques
consist of turning the occurrences of a pattern over an order-m Markov sequence into those …

A motif co-occurrence approach for genome-wide prediction of transcription-factor-binding sites in Escherichia coli

ML Bulyk, AM McGuire, N Masuda… - Genome research, 2004 - genome.cshlp.org
Various computational approaches have been developed for predicting cis-regulatory DNA
elements in prokaryotic genomes. We describe a novel method for predicting transcription …

Stem-loop structures in prokaryotic genomes

M Petrillo, G Silvestro, PP Di Nocera, A Boccia… - Bmc Genomics, 2006 - Springer
Background Prediction of secondary structures in the expressed sequences of bacterial
genomes allows to investigate spontaneous folding of the corresponding RNA. This is …

[图书][B] Algorithms in computational molecular biology: techniques, approaches and applications

Y Pan - 2011 - books.google.com
This book represents the most comprehensive and up-to-date collection of information on
the topic of computational molecular biology. Bringing the most recent research into the …

MUSA: a parameter free algorithm for the identification of biologically significant motifs

ND Mendes, AC Casimiro, PM Santos… - …, 2006 - academic.oup.com
Motivation: The ability to identify complex motifs, ie non-contiguous nucleotide sequences, is
a key feature of modern motif finders. Addressing this problem is extremely important, not …

Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics

G Nuel - Algorithms for molecular biology, 2006 - Springer
Abstract The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to
complex combinatorial problems related to sequences. In order to get efficient algorithms, it …