用换位网络进行串比较
String comparison by transposition networks
摘要：
计算字符串或序列比对是比较字符串的经典方法，并且在许多计算领域（诸如信号处理和生物信息学）中具有应用。半局部字符串对齐是这种方法的最新推广，其中给定字符串和另一个字符串的所有子串的对齐同时计算，没有额外的渐近成本。在本文中，我们表明，有一个密切的联系，半本地字符串对齐和某一类传统的比较网络被称为换位网络。转置网络方法可以用于以统一的形式表示不同的字符串比较算法，并且在某些情况下提供对现有算法的概括或改进。这种方法使我们能够获得新的算法稀疏半本地字符串比较和比较高度相似和高度不相似的字符串，以及运行长度压缩字符串。我们的结论是，换位网络方法是一个非常通用和灵活的方式来理解和改进不同的字符串比较算法，以及它们的有效实现。
英文摘要：
Computing string or sequence alignments is a classical method of comparing strings and has applications in many areas of computing, such as signal processing and bioinformatics. Semi-local string alignment is a recent generalisation of this method, in which the alignment of a given string and all substrings of another string are computed simultaneously at no additional asymptotic cost. In this paper, we show that there is a close connection between semi-local string alignment and a certain class of traditional comparison networks known as transposition networks. The transposition network approach can be used to represent different string comparison algorithms in a unified form, and in some cases provides generalisations or improvements on existing algorithms. This approach allows us to obtain new algorithms for sparse semi-local string comparison and for comparison of highly similar and highly dissimilar strings, as well as of run-length compressed strings. We conclude that the transposition network method is a very general and flexible way of understanding and improving different string comparison algorithms, as well as their efficient implementation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
