Secure Motif Finding Based on Candidate Pruning

Author(s):  
Kaijian Xia ◽  
Xiang Wu ◽  
Yaqing Mao ◽  
Huanhuan Wang
Keyword(s):  
2011 ◽  
Vol 9 (4) ◽  
pp. 326-334 ◽  
Author(s):  
Carl Kingsford ◽  
Elena Zaslavsky ◽  
Mona Singh

Biosystems ◽  
2011 ◽  
Vol 103 (3) ◽  
pp. 410-419 ◽  
Author(s):  
S. Pérès ◽  
F. Vallée ◽  
M. Beurton-Aimar ◽  
J.P. Mazat

2016 ◽  
Vol 2017 (2) ◽  
pp. pdb.top093195 ◽  
Author(s):  
Jui-Hung Hung ◽  
Zhiping Weng
Keyword(s):  

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 152076-152087
Author(s):  
Xiang Wu ◽  
Huanhuan Wang ◽  
Minyu Shi ◽  
Aming Wang ◽  
Kaijian Xia

2020 ◽  
Vol 21 ◽  
pp. 100466
Author(s):  
Faisal Bin Ashraf ◽  
Md Shafiur Raihan Shafi

2019 ◽  
Vol 35 (22) ◽  
pp. 4632-4639 ◽  
Author(s):  
Yang Li ◽  
Pengyu Ni ◽  
Shaoqiang Zhang ◽  
Guojun Li ◽  
Zhengchang Su

Abstract Motivation The availability of numerous ChIP-seq datasets for transcription factors (TF) has provided an unprecedented opportunity to identify all TF binding sites in genomes. However, the progress has been hindered by the lack of a highly efficient and accurate tool to find not only the target motifs, but also cooperative motifs in very big datasets. Results We herein present an ultrafast and accurate motif-finding algorithm, ProSampler, based on a novel numeration method and Gibbs sampler. ProSampler runs orders of magnitude faster than the fastest existing tools while often more accurately identifying motifs of both the target TFs and cooperators. Thus, ProSampler can greatly facilitate the efforts to identify the entire cis-regulatory code in genomes. Availability and implementation Source code and binaries are freely available for download at https://github.com/zhengchangsulab/prosampler. It was implemented in C++ and supported on Linux, macOS and MS Windows platforms. Supplementary information Supplementary materials are available at Bioinformatics online.


Sign in / Sign up

Export Citation Format

Share Document