发布求助
文献互助 智能选刊 最新文献

Pattern Matching Algorithms最新文献

筛选
英文 中文
Parallel computations of Levenshtein distances Levenshtein距离的并行计算
Pattern Matching Algorithms Pub Date : 1997-05-29 DOI: 10.1093/oso/9780195113679.003.0008
A. Apostolico, M. Atallah
{"title":"Parallel computations of Levenshtein distances","authors":"A. Apostolico, M. Atallah","doi":"10.1093/oso/9780195113679.003.0008","DOIUrl":"https://doi.org/10.1093/oso/9780195113679.003.0008","url":null,"abstract":"","PeriodicalId":118409,"journal":{"name":"Pattern Matching Algorithms","volume":"37 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":"126955403","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}
引用次数: 0
Suffix tree data structures for matrices 矩阵的后缀树数据结构
Pattern Matching Algorithms Pub Date : 1997-05-29 DOI: 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}
引用次数: 19
Approximate string searching 近似字符串搜索
Pattern Matching Algorithms Pub Date : 1997-05-29 DOI: 10.1093/oso/9780195113679.003.0009
G. M. Landau, U. Vishkin
{"title":"Approximate string searching","authors":"G. M. Landau, U. Vishkin","doi":"10.1093/oso/9780195113679.003.0009","DOIUrl":"https://doi.org/10.1093/oso/9780195113679.003.0009","url":null,"abstract":"","PeriodicalId":118409,"journal":{"name":"Pattern Matching Algorithms","volume":"117 1 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":"129111937","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}
引用次数: 0
Serial computations of Levenshtein distances Levenshtein距离的连续计算
Pattern Matching Algorithms Pub Date : 1997-05-29 DOI: 10.1093/oso/9780195113679.003.0007
D. Hirschberg
{"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}
引用次数: 44
Two dimensional matching 二维匹配
Pattern Matching Algorithms Pub Date : 1997-05-29 DOI: 10.1093/oso/9780195113679.003.0012
A. Amir, Martín Farach-Colton
{"title":"Two dimensional matching","authors":"A. Amir, Martín Farach-Colton","doi":"10.1093/oso/9780195113679.003.0012","DOIUrl":"https://doi.org/10.1093/oso/9780195113679.003.0012","url":null,"abstract":"","PeriodicalId":118409,"journal":{"name":"Pattern Matching Algorithms","volume":"122 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":"114343919","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}
引用次数: 3
Off-line parallel exact string searching 离线并行精确字符串搜索
Pattern Matching Algorithms Pub Date : 1997-05-29 DOI: 10.1093/oso/9780195113679.003.0005
Z. Galil, I. Yudkiewicz
{"title":"Off-line parallel exact string searching","authors":"Z. Galil, I. Yudkiewicz","doi":"10.1093/oso/9780195113679.003.0005","DOIUrl":"https://doi.org/10.1093/oso/9780195113679.003.0005","url":null,"abstract":"","PeriodicalId":118409,"journal":{"name":"Pattern Matching Algorithms","volume":"1 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":"129418438","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}
引用次数: 0
Tree pattern matching 树型匹配
Pattern Matching Algorithms Pub Date : 1997-05-29 DOI: 10.1093/oso/9780195113679.003.0014
Kaizhong Zhang, D. Shasha
{"title":"Tree pattern matching","authors":"Kaizhong Zhang, D. Shasha","doi":"10.1093/oso/9780195113679.003.0014","DOIUrl":"https://doi.org/10.1093/oso/9780195113679.003.0014","url":null,"abstract":"","PeriodicalId":118409,"journal":{"name":"Pattern Matching Algorithms","volume":"692 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":"133571469","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}
引用次数: 69
On-line string searching 在线字符串搜索
Pattern Matching Algorithms Pub Date : 1997-05-29 DOI: 10.1093/oso/9780195113679.003.0006
A. Apostolico
{"title":"On-line string searching","authors":"A. Apostolico","doi":"10.1093/oso/9780195113679.003.0006","DOIUrl":"https://doi.org/10.1093/oso/9780195113679.003.0006","url":null,"abstract":"","PeriodicalId":118409,"journal":{"name":"Pattern Matching Algorithms","volume":"66 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":"131518223","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}
引用次数: 2
Off-line serial exact string searching 脱机串行精确字符串搜索
Pattern Matching Algorithms Pub Date : 1997-05-29 DOI: 10.1093/oso/9780195113679.003.0004
M. Crochemore
{"title":"Off-line serial exact string searching","authors":"M. Crochemore","doi":"10.1093/oso/9780195113679.003.0004","DOIUrl":"https://doi.org/10.1093/oso/9780195113679.003.0004","url":null,"abstract":"","PeriodicalId":118409,"journal":{"name":"Pattern Matching Algorithms","volume":"94 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":"125868731","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}
引用次数: 10
Dynamic programming: special cases 动态规划:特殊情况
Pattern Matching Algorithms Pub Date : 1997-05-29 DOI: 10.1093/oso/9780195113679.003.0010
R. Giancarlo
{"title":"Dynamic programming: special cases","authors":"R. Giancarlo","doi":"10.1093/oso/9780195113679.003.0010","DOIUrl":"https://doi.org/10.1093/oso/9780195113679.003.0010","url":null,"abstract":"","PeriodicalId":118409,"journal":{"name":"Pattern Matching Algorithms","volume":"78 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":"132293040","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}
引用次数: 20
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信