{"title":"字符串搜索算法","authors":"G. Stephen","doi":"10.1142/2418","DOIUrl":null,"url":null,"abstract":"String Matching String Distance and Common Sequences Suffix Trees Approximate String Matching Repeated Substrings.","PeriodicalId":242664,"journal":{"name":"Lecture Notes Series on Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"371","resultStr":"{\"title\":\"String Searching Algorithms\",\"authors\":\"G. Stephen\",\"doi\":\"10.1142/2418\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"String Matching String Distance and Common Sequences Suffix Trees Approximate String Matching Repeated Substrings.\",\"PeriodicalId\":242664,\"journal\":{\"name\":\"Lecture Notes Series on Computing\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-01-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"371\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Lecture Notes Series on Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/2418\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Lecture Notes Series on Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/2418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
