DNA binding sites: representation and discovery
DNA binding sites: representation and discovery
复制标题
DOI：
10.1093/bioinformatics/16.1.16
复制
发表时间：
2000-01-01
期刊：
影响因子：
5.8
通讯作者：
Stormo, GD
中科院分区：
文献类型：
--
作者：
Stormo, GD
本文的目的是提供一个简短的历史的发展和应用的计算机算法的分析和预测的DNA结合位点。这个问题可以方便地分为两个子问题。第一种是，给定已知结合位点的集合，开发这些位点的表示，可以用于搜索新序列并可靠地预测额外的结合位点出现的位置：第二种是，给定一组已知包含共同因子的结合位点但不知道位点在哪里的序列，发现每个序列中位点的位置和蛋白质特异性的表示。联系人：stormo@ural.wustl.edu。
The purpose of this article is to provide a brief history of the development and application of computer algorithms for the analysis and prediction of DNA binding sites. This problem can be conveniently divided into two subproblems. The first is, given a collection of known binding sites, develop a representation of those sites that can be used to search new sequences and reliably predict where additional binding sites occur: The second is, given a set of sequences known to contain binding sites for a common factor but not knowing where the sites are, discover the location of the sites in each sequence and a representation for the specificity of the protein. Contact: stormo@ural.wustl.edu.