{"title":"字符串中的最佳并行模式匹配","authors":"Uzi Vishkin","doi":"10.1016/S0019-9958(85)80028-0","DOIUrl":null,"url":null,"abstract":"<div><p>Given a text of length <em>n</em> and a pattern of length <em>m</em>, we present a parallel linear algorithm for finding all occurrences of the pattern in the text. The algorithm runs in <em>O</em>(<em>n/p</em>) time using any number of <em>p</em> ⩽ <em>n</em>/log <em>m</em> processors on a concurrent-read concurrent-write parallel random-access-machine.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 91-113"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80028-0","citationCount":"135","resultStr":"{\"title\":\"Optimal parallel pattern matching in strings\",\"authors\":\"Uzi Vishkin\",\"doi\":\"10.1016/S0019-9958(85)80028-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Given a text of length <em>n</em> and a pattern of length <em>m</em>, we present a parallel linear algorithm for finding all occurrences of the pattern in the text. The algorithm runs in <em>O</em>(<em>n/p</em>) time using any number of <em>p</em> ⩽ <em>n</em>/log <em>m</em> processors on a concurrent-read concurrent-write parallel random-access-machine.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"67 1\",\"pages\":\"Pages 91-113\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80028-0\",\"citationCount\":\"135\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800280\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800280","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
Given a text of length n and a pattern of length m, we present a parallel linear algorithm for finding all occurrences of the pattern in the text. The algorithm runs in O(n/p) time using any number of p ⩽ n/log m processors on a concurrent-read concurrent-write parallel random-access-machine.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
