Levenshtein距离的并行计算

{"title":"Levenshtein距离的并行计算","authors":"A. Apostolico, M. Atallah","doi":"10.1093/oso/9780195113679.003.0008","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":118409,"journal":{"name":"Pattern Matching Algorithms","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parallel computations of Levenshtein distances\",\"authors\":\"A. Apostolico, M. Atallah\",\"doi\":\"10.1093/oso/9780195113679.003.0008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":118409,\"journal\":{\"name\":\"Pattern Matching Algorithms\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Pattern Matching Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/oso/9780195113679.003.0008\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Matching Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/oso/9780195113679.003.0008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}