Serial computations of Levenshtein distances

D. Hirschberg
{"title":"Serial computations of Levenshtein distances","authors":"D. Hirschberg","doi":"10.1093/oso/9780195113679.003.0007","DOIUrl":null,"url":null,"abstract":"In the previous chapters, we discussed problems involving an exact match of string patterns. We now turn to problems involving similar but not necessarily exact pattern matches. There are a number of similarity or distance measures, and many of them are special cases or generalizations of the Levenshtein metric. The problem of evaluating the measure of string similarity has numerous applications, including one arising in the study of the evolution of long molecules such as proteins. In this chapter, we focus on the problem of evaluating a longest common subsequence, which is expressively equivalent to the simple form of the Levenshtein distance.","PeriodicalId":118409,"journal":{"name":"Pattern Matching Algorithms","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Matching Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/oso/9780195113679.003.0007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 44

Abstract

In the previous chapters, we discussed problems involving an exact match of string patterns. We now turn to problems involving similar but not necessarily exact pattern matches. There are a number of similarity or distance measures, and many of them are special cases or generalizations of the Levenshtein metric. The problem of evaluating the measure of string similarity has numerous applications, including one arising in the study of the evolution of long molecules such as proteins. In this chapter, we focus on the problem of evaluating a longest common subsequence, which is expressively equivalent to the simple form of the Levenshtein distance.
Levenshtein距离的连续计算
在前面的章节中,我们讨论了涉及字符串模式精确匹配的问题。现在我们转向涉及类似但不一定精确的模式匹配的问题。有许多相似度或距离度量,其中许多是Levenshtein度量的特殊情况或推广。评估弦相似性的问题有许多应用,包括在研究长分子(如蛋白质)的进化中出现的问题。在这一章中,我们主要讨论最长公共子序列的求值问题,它在表达式上等价于Levenshtein距离的简单形式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信