Mallios Ronna Reuben
Grants and Research Office, Fresno, CA, USA.
Methods Mol Biol. 2007;409:341-53. doi: 10.1007/978-1-60327-118-9_25.
An iterative approach to resolving protein-peptide binding motifs is appropriate when the length of the binding protein is variable and a variety of amino acid residues may successfully occupy multiple positions. This chapter describes an iterative algorithm that first aligns binding peptides of variable lengths and then extracts a quantitative motif from the resulting alignment. Numerous examples are presented to illustrate the utility of the iterative process.
当结合蛋白的长度可变且多种氨基酸残基可能成功占据多个位置时,采用迭代方法解析蛋白质 - 肽结合基序是合适的。本章描述了一种迭代算法,该算法首先对齐可变长度的结合肽,然后从所得比对中提取定量基序。给出了许多例子来说明迭代过程的实用性。