scholarly journals De Novo Regulatory Motif Discovery Identifies Significant Motifs in Promoters of Five Classes of Plant Dehydrin Genes

PLoS ONE ◽  
2015 ◽  
Vol 10 (6) ◽  
pp. e0129016 ◽  
Author(s):  
Yevgen Zolotarov ◽  
Martina Strömvik
2007 ◽  
Vol 4 (7) ◽  
pp. 563-565 ◽  
Author(s):  
Laurence Ettwiller ◽  
Benedict Paten ◽  
Mirana Ramialison ◽  
Ewan Birney ◽  
Joachim Wittbrodt

BMC Genomics ◽  
2018 ◽  
Vol 19 (1) ◽  
Author(s):  
Louis T. Dang ◽  
Markus Tondl ◽  
Man Ho H. Chiu ◽  
Jerico Revote ◽  
Benedict Paten ◽  
...  

Biotechnology ◽  
2019 ◽  
pp. 1069-1085
Author(s):  
Andrei Lihu ◽  
Ștefan Holban

De novo motif discovery is essential in understanding the cis-regulatory processes that play a role in gene expression. Finding unknown patterns of unknown lengths in massive amounts of data has long been a major challenge in computational biology. Because algorithms for motif prediction have always suffered of low performance issues, there is a constant effort to find better techniques. Evolutionary methods, including swarm intelligence algorithms, have been applied with limited success for motif prediction. However, recently developed methods, such as the Fireworks Algorithm (FWA) which simulates the explosion process of fireworks, may show better prospects. This paper describes a motif finding algorithm based on FWA that maximizes the Kullback-Leibler divergence between candidate solutions and the background noise. Following the terminology of FWA's framework, the candidate motifs are fireworks that generate additional sparks (i.e. derived motifs) in their neighborhood. During the iterations, better sparks can replace the fireworks, as the Fireworks Motif Finder (FW-MF) assumes a one occurrence per sequence mode. The results obtained on a standard benchmark for promoter analysis show that our proof of concept is promising.


2015 ◽  
Vol 6 (3) ◽  
pp. 24-40 ◽  
Author(s):  
Andrei Lihu ◽  
Ștefan Holban

De novo motif discovery is essential in understanding the cis-regulatory processes that play a role in gene expression. Finding unknown patterns of unknown lengths in massive amounts of data has long been a major challenge in computational biology. Because algorithms for motif prediction have always suffered of low performance issues, there is a constant effort to find better techniques. Evolutionary methods, including swarm intelligence algorithms, have been applied with limited success for motif prediction. However, recently developed methods, such as the Fireworks Algorithm (FWA) which simulates the explosion process of fireworks, may show better prospects. This paper describes a motif finding algorithm based on FWA that maximizes the Kullback-Leibler divergence between candidate solutions and the background noise. Following the terminology of FWA's framework, the candidate motifs are fireworks that generate additional sparks (i.e. derived motifs) in their neighborhood. During the iterations, better sparks can replace the fireworks, as the Fireworks Motif Finder (FW-MF) assumes a one occurrence per sequence mode. The results obtained on a standard benchmark for promoter analysis show that our proof of concept is promising.


2020 ◽  
Vol 36 (9) ◽  
pp. 2905-2906 ◽  
Author(s):  
Kevin R Shieh ◽  
Christina Kratschmer ◽  
Keith E Maier ◽  
John M Greally ◽  
Matthew Levy ◽  
...  

Abstract Summary High-throughput sequencing can enhance the analysis of aptamer libraries generated by the Systematic Evolution of Ligands by EXponential enrichment. Robust analysis of the resulting sequenced rounds is best implemented by determining a ranked consensus of reads following the processing by multiple aptamer detection algorithms. While several such approaches have been developed to this end, their installation and implementation is problematic. We developed AptCompare, a cross-platform program that combines six of the most widely used analytical approaches for the identification of RNA aptamer motifs and uses a simple weighted ranking to order the candidate aptamers, all driven within the same GUI-enabled environment. We demonstrate AptCompare’s performance by identifying the top-ranked candidate aptamers from a previously published selection experiment in our laboratory, with follow-up bench assays demonstrating good correspondence between the sequences’ rankings and their binding affinities. Availability and implementation The source code and pre-built virtual machine images are freely available at https://bitbucket.org/shiehk/aptcompare. Supplementary information Supplementary data are available at Bioinformatics online.


2006 ◽  
Vol 34 (Web Server) ◽  
pp. W566-W570 ◽  
Author(s):  
G. Pavesi ◽  
P. Mereghetti ◽  
F. Zambelli ◽  
M. Stefani ◽  
G. Mauri ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document