Motif finding in nucleotide sequences for the discovery of over-represented transcription factor binding sites is a very challenging problem, both from the computational and the experimental points of view. Transcription factors in fact recognize very weakly conserved sequence elements, that in typical applications are very hard to discriminate against random sequence similarities. Recent advances in technology like ChIP-Seq can generate better datasets to be investigated, in which the degree of conservation of binding sites is higher: on the other hand, the size itself of the datasets has posed new challenges for the design of efficient algorithms able to produce results in reasonable time. In this work we present an updated version of our algorithm Weeder, in which time and space requirements are significantly reduced and, moreover, also the accuracy of the results is notably improved.
A Faster Algorithm for Motif Finding in Sequences from ChIP-Seq Data / F. Zambelli, G. Pavesi - In: Computational Intelligence Methods for Bioinformatics and Biostatistics / [a cura di] E. Biganzoli, A. Vellido, F. Ambrogi, R. Tagliaferri. - [s.l] : Springer, 2012. - ISBN 978-3-642-35685-8. - pp. 201-212 (( Intervento presentato al 8. convegno CIBB 2011 tenutosi a Gargnano del Garda nel 2011.
|Titolo:||A Faster Algorithm for Motif Finding in Sequences from ChIP-Seq Data|
ZAMBELLI, FEDERICO (Primo)
PAVESI, GIULIO (Ultimo)
|Parole Chiave:||motif finding ; chip-seq ; motif discovery ;|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
Settore BIO/11 - Biologia Molecolare
|Data di pubblicazione:||2012|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-642-35686-5_17|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|