BLANT:网络拓扑的基本局部对齐,第1部分:使用明确的8节点graphlets播种局部对齐
BLANT: Basic Local Alignment of Network Topology, Part 1: Seeding local alignments with unambiguous 8-node graphlets
摘要:
BLAST是生物信息学中的标准工具,用于使用“种子和延伸”方法创建局部序列比对。在这里,我们介绍一个类似的种子和扩展算法,产生本地网络对齐:BLANT,网络拓扑的基本本地对齐。本文介绍了BLANT-seed:给定一个输入图,BLANT-seed仅使用网络拓扑来创建一个有限的,高特异性的k节点诱导子图索引,称为k-graphlets(类似于BLASTS的k-mers)。索引的构造使得如果两个图之间存在重要的公共网络拓扑,则它们的索引可能重叠。然后,BLANT-seed查询两个网络的索引,以生成一个共同的k-小图列表,当它们配对时,形成一个种子对。我们的同伴论文(在其他地方提交)描述了BLANT-extend,它“生长”这些种子到更大的局部比对,同样只使用拓扑信息。
英文摘要:
BLAST is a standard tool in bioinformatics for creating local sequence alignments using a "seed-and-extend" approach. Here we introduce an analogous seed-and-extend algorithm that produces local network alignments: BLANT, for Basic Local Alignment of Network Topology. This paper introduces BLANT-seed: given an input graph, BLANT-seed uses network topology alone to create a limited, high-specificity index of k-node induced subgraphs called k-graphlets (analogous to BLASTS's k-mers). The index is constructed so that, if significant common network topology exists between two graphs, their indexes are likely to overlap. BLANT-seed then queries the indexes of two networks to generate a list of common k-graphlets which, when paired, form a seed pair. Our companion paper (submitted elsewhere) describes BLANT-extend, which "grows" these seeds to larger local alignments, again using only topological information.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。