arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.00664q-bio.MNcs.LGcs.SI
收藏

VeRNAl:挖掘模糊基对网络模体的RNA结构

VeRNAl: Mining RNA Structures for Fuzzy Base Pairing Network Motifs

McGill University(麦吉尔大学);Montreal Institute for Learning Algorithms (MILA)(蒙特利尔学习算法研究所);Institut Pasteur(巴斯德研究所);Mines ParisTech(巴黎高等矿业学院);Paris-Sciences-et-Lettres Research University(巴黎文理研究大学)

Carlos Oliver, Vincent Mallet, Pericles Philippopoulos, William L. Hamilton, Jerome Waldispuhl

摘要:

RNA 3D基序是重复出现的子结构,被建模为碱基对相互作用的网络,这对于理解结构与功能关系至关重要。自动识别这些基序的任务在计算上是困难的,并且仍然是RNA结构生物学和网络分析领域的关键挑战。现有技术的方法通过约束基序出现时的结构可变性和缩小子结构搜索空间来解决基序问题的特殊情况。在这里,我们放松这些限制,构成的图案发现问题作为一个图形表示学习和聚类任务。这种框架利用了图形表示的连续性,以有效的方式对RNA基序的灵活性和可变性进行建模。我们提出了一套节点相似性函数,聚类方法和基序构建算法来恢复灵活的RNA基序。我们的工具,VeRNAl可以很容易地定制由用户所需的水平的图案的灵活性,丰富性和大小。我们表明,VeRNAl是能够检索和扩展已知类的图案,以及提出新的图案。

英文摘要:

RNA 3D motifs are recurrent substructures, modelled as networks of base pair interactions, which are crucial for understanding structure-function relationships. The task of automatically identifying such motifs is computationally hard, and remains a key challenge in the field of RNA structural biology and network analysis. State of the art methods solve special cases of the motif problem by constraining the structural variability in occurrences of a motif, and narrowing the substructure search space. Here, we relax these constraints by posing the motif finding problem as a graph representation learning and clustering task. This framing takes advantage of the continuous nature of graph representations to model the flexibility and variability of RNA motifs in an efficient manner. We propose a set of node similarity functions, clustering methods, and motif construction algorithms to recover flexible RNA motifs. Our tool, VeRNAl can be easily customized by users to desired levels of motif flexibility, abundance and size. We show that VeRNAl is able to retrieve and expand known classes of motifs, as well as to propose novel motifs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑