Pub Date : 1997-05-29DOI: 10.1093/oso/9780195113679.003.0013
R. Giancarlo, R. Grossi
{"title":"Suffix tree data structures for matrices","authors":"R. Giancarlo, R. Grossi","doi":"10.1093/oso/9780195113679.003.0013","DOIUrl":"https://doi.org/10.1093/oso/9780195113679.003.0013","url":null,"abstract":"","PeriodicalId":118409,"journal":{"name":"Pattern Matching Algorithms","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124966013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1997-05-29DOI: 10.1093/oso/9780195113679.003.0007
D. Hirschberg
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.
{"title":"Serial computations of Levenshtein distances","authors":"D. Hirschberg","doi":"10.1093/oso/9780195113679.003.0007","DOIUrl":"https://doi.org/10.1093/oso/9780195113679.003.0007","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.0,"publicationDate":"1997-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132200558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：