Logan Robert, Wehe Amy Wangsness, Woods Dori C, Tilly Jon, Khrapko Konstantin
Science and Technology Division, Biology and Bioinformatics Department, Eastern Nazarene College, Quincy, MA 02170.
Health and Natural Sciences Division, Mathematics Department, Fitchburg State University, Fitch-burg, MA 01420-2697.
ArXiv. 2023 Oct 19:arXiv:2310.12833v1.
Levenshtein distance is a commonly used edit distance metric, typically applied in language processing, and to a lesser extent, in molecular biology analysis. Biological nucleic acid sequences are often embedded in longer sequences and are subject to insertion and deletion errors that introduce frameshift during sequencing. These frameshift errors are due to string context and should not be counted as true biological errors. Sequence-Levenshtein distance is a modification to Levenshtein distance that is permissive of frameshift error without additional penalty. However, in a biological context Levenshtein distance needs to accommodate both frameshift and weighted errors, which Sequence-Levenshtein distance cannot do. Errors are weighted when they are associated with a numerical cost that corresponds to their frequency of appearance. Here, we describe a modification that allows the use of Levenshtein distance and Sequence-Levenshtein distance to appropriately accommodate penalty-free frameshift between embedded sequences and correctly weight specific error types.
莱文斯坦距离是一种常用的编辑距离度量,通常应用于语言处理,在分子生物学分析中应用相对较少。生物核酸序列常常嵌入在较长的序列中,并且容易出现插入和缺失错误,这些错误在测序过程中会导致移码。这些移码错误是由于序列上下文引起的,不应被视为真正的生物学错误。序列莱文斯坦距离是对莱文斯坦距离的一种修改,它允许移码错误而不额外惩罚。然而,在生物学背景下,莱文斯坦距离需要同时考虑移码和加权错误,而序列莱文斯坦距离无法做到这一点。当错误与对应于其出现频率的数值代价相关联时,这些错误会被加权。在此,我们描述了一种修改方法,该方法允许使用莱文斯坦距离和序列莱文斯坦距离来适当地处理嵌入序列之间无惩罚的移码,并正确地对特定错误类型进行加权。