In search of the boundary between repetitive and non-repetitive protein sequences

Author:

Richard François D.12,Kajava Andrey V.123

Affiliation:

1. Centre de Recherches de Biochimie Macromoléculaire, UMR 5237 CNRS, Université Montpellier, 1919 Route de Mende, 34293 Montpellier, Cedex 5, France

2. Institut de Biologie Computationnelle, 860 rue St Priest, Bâtiment 5, 34095 Montpellier, France

3. University ITMO, 49 Kronverksky Pr, 197101, St. Petersburg, Russia

Abstract

Tandem repeats (TRs) are frequently not perfect, containing a number of mutations accumulated during evolution. One of the main problems is to distinguish between the sequences that contain highly imperfect TRs and the aperiodic sequences. The majority of proteins with TRs in sequences have repetitive arrangements in their 3D structures. Therefore, the 3D structures of proteins can be used as a benchmarking criterion for TR detection in sequences. Different TR detection tools use their own scoring procedures to determine the boundary between repetitive and non-repetitive protein sequences. Here we described these scoring functions and benchmark them by using known structural TRs. Our survey shows that none of the existing scoring procedures are able to achieve an appropriate separation between genuine structural TRs and non-TR regions. This suggests that if we want to obtain a collection of structurally and functionally meaningful TRs from a large scale analysis of proteomes, the TR scoring metrics need to be improved.

Publisher

Portland Press Ltd.

Subject

Biochemistry

Reference27 articles.

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3