Suppr超能文献

Computational detection of significant variation in binding affinity across two sets of sequences with application to the analysis of replication origins in yeast.

作者信息

Keich Uri, Gao Hong, Garretson Jeffrey S, Bhaskar Anand, Liachko Ivan, Donato Justin, Tye Bik K

机构信息

Department of Computer Science, Cornell University, Ithaca, NY 14853, USA.

出版信息

BMC Bioinformatics. 2008 Sep 12;9:372. doi: 10.1186/1471-2105-9-372.

Abstract

BACKGROUND

In analyzing the stability of DNA replication origins in Saccharomyces cerevisiae we faced the question whether one set of sequences is significantly enriched in the number and/or the quality of the matches of a particular position weight matrix relative to another set.

RESULTS

We present SADMAMA, a computational solution to a address this problem. SADMAMA implements two types of statistical tests to answer this question: one type is based on simplified models, while the other relies on bootstrapping, and as such might be preferable to users who are averse to such models. The bootstrap approach incorporates a novel "site-protected" resampling procedure which solves a problem we identify with naive resampling.

CONCLUSION

SADMAMA's utility is demonstrated here by offering a plausible explanation to the differential ARS activity observed in our previous mcm1-1 mutant experiments 1, by suggesting the relevance of multiple weak ACS matches to efficient replication origin function in Saccharomyces cerevisiae, and by suggesting an explanation to the observed negative effect FKH2 has on chromatin silencing 2. SADMAMA is available for download from http://www.cs.cornell.edu/~keich/.

摘要
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b58a/2566582/5ad4e71ddae4/1471-2105-9-372-1.jpg

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验