Discovering sequence motifs with arbitrary insertions and deletions

被引:246
|
作者
Frith, Martin C. [1 ]
Saunders, Neil F. W. [2 ]
Kobe, Bostjan [2 ,3 ]
Bailey, Timothy L. [3 ]
机构
[1] Natl Inst Adv Ind Sci & Technol, Computat Biol Res Ctr, Tokyo, Japan
[2] Univ Queensland, Sch Mol & Microbial Sci, Brisbane, Qld, Australia
[3] Univ Queensland, Inst Mol Biosci, Brisbane, Qld, Australia
关键词
D O I
10.1371/journal.pcbi.1000071
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Biology is encoded in molecular sequences: deciphering this encoding remains a grand scientific challenge. Functional regions of DNA, RNA, and protein sequences often exhibit characteristic but subtle motifs; thus, computational discovery of motifs in sequences is a fundamental and much-studied problem. However, most current algorithms do not allow for insertions or deletions (indels) within motifs, and the few that do have other limitations. We present a method, GLAM2 (Gapped Local Alignment of Motifs), for discovering motifs allowing indels in a fully general manner, and a companion method GLAM2SCAN for searching sequence databases using such motifs. GLAM2 is a generalization of the gapless Gibbs sampling algorithm. It re-discovers variable-width protein motifs from the PROSITE database significantly more accurately than the alternative methods PRATT and SAM-T2K. Furthermore, it usefully refines protein motifs from the ELM database: in some cases, the refined motifs make orders of magnitude fewer overpredictions than the original ELM regular expressions. GLAM2 performs respectably on the BAliBASE multiple alignment benchmark, and may be superior to leading multiple alignment methods for "motif-like'' alignments with N- and C-terminal extensions. Finally, we demonstrate the use of GLAM2 to discover protein kinase substrate motifs and a gapped DNA motif for the LIM-only transcriptional regulatory complex: using GLAM2SCAN, we identify promising targets for the latter. GLAM2 is especially promising for short protein motifs, and it should improve our ability to identify the protein cleavage sites, interaction sites, post-translational modification attachment sites, etc., that underlie much of biology. It may be equally useful for arbitrarily gapped motifs in DNA and RNA, although fewer examples of such motifs are known at present. GLAM2 is public domain software, available for download at http://bioinformatics.org.au/glam2.
引用
下载
收藏
页数:12
相关论文
共 50 条
  • [31] Covering Codes Using Insertions or Deletions
    Lenz, Andreas
    Rashtchian, Cyrus
    Siegel, Paul H.
    Yaakobi, Eitan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (06) : 3376 - 3388
  • [32] Genomic distances under deletions and insertions
    Marron, M
    Swenson, KM
    Moret, BME
    THEORETICAL COMPUTER SCIENCE, 2004, 325 (03) : 347 - 360
  • [33] Genomic distances under deletions and insertions
    Marron, M
    Swenson, KM
    Moret, BME
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2003, 2697 : 537 - 547
  • [34] Marker codes for channels with insertions and deletions
    Ratzer, EA
    ANNALS OF TELECOMMUNICATIONS, 2005, 60 (1-2) : 29 - 44
  • [35] ANALYSIS OF INSERTIONS DELETIONS IN PROTEIN STRUCTURES
    PASCARELLA, S
    ARGOS, P
    JOURNAL OF MOLECULAR BIOLOGY, 1992, 224 (02) : 461 - 471
  • [36] Achievable Rates for Channels With Deletions and Insertions
    Venkataramanan, Ramji
    Tatikonda, Sekhar
    Ramchandran, Kannan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (11) : 6990 - 7013
  • [37] Codes Correcting a Burst of Deletions or Insertions
    Schoeny, Clayton
    Wachter-Zeh, Antonia
    Gabrys, Ryan
    Yaakobi, Eitan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (04) : 1971 - 1985
  • [38] Discovering sequence-structure motifs from protein segments and two applications
    Tang, T
    Xu, JB
    Li, M
    PACIFIC SYMPOSIUM ON BIOCOMPUTING 2005, 2005, : 370 - 381
  • [39] Double Cut and Join with Insertions and Deletions
    Braga, Marilia D. V.
    Willing, Eyla
    Stoye, Jens
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2011, 18 (09) : 1167 - 1184
  • [40] Achievable Rates for Channels with Deletions and Insertions
    Venkataramanan, Ramji
    Tatikonda, Sekhar
    Ramchandran, Kannan
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011, : 346 - 350