arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.06138q-bio.GNq-bio.QM
收藏

一种新的字符串编辑距离及其应用

A New String Edit Distance and Applications

Taylor Petty, Jan Hannig, Tunde I Huszar, Hari Iyer

摘要:

几十年来,字符串编辑距离一直被用于从拼写纠正和网络搜索建议到DNA分析的应用中。大多数字符串编辑距离是Levenshtein距离的变体,并且只考虑单个字符的编辑。在法医应用中,使用多态性遗传标记,如短串联重复序列(STR)。在这些重复的基序中,DNA复制错误不仅仅由单个碱基差异组成。更常见的是观察到“口吃”现象,其中重复单元的数量与模板不同(通过整个单元)。为了使Levenshtein距离适合于DNA序列相似性感兴趣的法医应用,定义了广义字符串编辑距离,其除了单核苷酸编辑之外还容纳整个基序的添加或删除。一个动态编程实现的计算序列之间的距离。该算法的新颖之处在于处理多字符编辑和单字符编辑之间出现的复杂交互。法医的例子说明了限制法医Levenshtein(RFL)距离测量的目的和用途,但应用程序扩展到序列比对和字符串相似性在其他生物领域,以及更广泛的动态编程算法。

英文摘要:

String edit distances have been used for decades in applications ranging from spelling correction and web search suggestions to DNA analysis. Most string edit distances are variations of the Levenshtein distance and consider only single-character edits. In forensic applications polymorphic genetic markers such as short tandem repeats (STRs) are used. At these repetitive motifs the DNA copying errors consist of more than just single base differences. More often the phenomenon of ``stutter'' is observed, where the number of repeated units differs (by whole units) from the template. To adapt the Levenshtein distance to be suitable for forensic applications where DNA sequence similarity is of interest, a generalized string edit distance is defined that accommodates the addition or deletion of whole motifs in addition to single-nucleotide edits. A dynamic programming implementation is developed for computing this distance between sequences. The novelty of this algorithm is in handling the complex interactions that arise between multiple- and single-character edits. Forensic examples illustrate the purpose and use of the Restricted Forensic Levenshtein (RFL) distance measure, but applications extend to sequence alignment and string similarity in other biological areas, as well as dynamic programming algorithms more broadly.

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

↑