{"id":"https://openalex.org/W2019219986","doi":"https://doi.org/10.1137/s0097539792190157","title":"Parallel Suffix\u2013Prefix-Matching Algorithm and Applications","display_name":"Parallel Suffix\u2013Prefix-Matching Algorithm and Applications","publication_year":1996,"publication_date":"1996-10-01","ids":{"openalex":"https://openalex.org/W2019219986","doi":"https://doi.org/10.1137/s0097539792190157","mag":"2019219986"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792190157","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792190157","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017861669","display_name":"Zvi M. Kedem","orcid":"https://orcid.org/0000-0002-1353-4584"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zvi M. Kedem","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111624806","display_name":"Gad M. Landau","orcid":null},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gad M. Landau","raw_affiliation_strings":["Polytechnic University, Brooklyn,"],"affiliations":[{"raw_affiliation_string":"Polytechnic University, Brooklyn,","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061421817","display_name":"Krishna V. Palem","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Krishna V. Palem","raw_affiliation_strings":["IBM"],"affiliations":[{"raw_affiliation_string":"IBM","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5017861669"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5522,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.74540072,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"5","first_page":"998","last_page":"1023"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.8373625874519348},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7425050735473633},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.6863957047462463},{"id":"https://openalex.org/keywords/commentz-walter-algorithm","display_name":"Commentz-Walter algorithm","score":0.6631963849067688},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.6331854462623596},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.6330961585044861},{"id":"https://openalex.org/keywords/approximate-string-matching","display_name":"Approximate string matching","score":0.6092996597290039},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5908465385437012},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5804133415222168},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.5694168210029602},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.5475401282310486},{"id":"https://openalex.org/keywords/boyer\u2013moore-string-search-algorithm","display_name":"Boyer\u2013Moore string search algorithm","score":0.5460153222084045},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.5108282566070557},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5101056694984436},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.4861893057823181},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48100265860557556},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4380253851413727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31993111968040466},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3016854226589203},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.2840932011604309},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08617091178894043}],"concepts":[{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.8373625874519348},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7425050735473633},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.6863957047462463},{"id":"https://openalex.org/C13052355","wikidata":"https://www.wikidata.org/wiki/Q5152399","display_name":"Commentz-Walter algorithm","level":4,"score":0.6631963849067688},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.6331854462623596},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.6330961585044861},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.6092996597290039},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5908465385437012},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5804133415222168},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.5694168210029602},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.5475401282310486},{"id":"https://openalex.org/C80701825","wikidata":"https://www.wikidata.org/wiki/Q895984","display_name":"Boyer\u2013Moore string search algorithm","level":5,"score":0.5460153222084045},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.5108282566070557},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5101056694984436},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.4861893057823181},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48100265860557556},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4380253851413727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31993111968040466},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3016854226589203},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2840932011604309},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08617091178894043},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539792190157","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792190157","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W137867423","https://openalex.org/W1968633186","https://openalex.org/W1972418517","https://openalex.org/W1983243118","https://openalex.org/W1984236772","https://openalex.org/W1984398316","https://openalex.org/W1984548556","https://openalex.org/W1985108724","https://openalex.org/W1991454799","https://openalex.org/W2002148379","https://openalex.org/W2003200876","https://openalex.org/W2032995245","https://openalex.org/W2040111098","https://openalex.org/W2080721852","https://openalex.org/W2086273045","https://openalex.org/W2090223576","https://openalex.org/W2099964107","https://openalex.org/W2111297109","https://openalex.org/W2120490947","https://openalex.org/W2130566259","https://openalex.org/W2134826720","https://openalex.org/W2143462372","https://openalex.org/W4212840250"],"related_works":["https://openalex.org/W2054173104","https://openalex.org/W2051764263","https://openalex.org/W3145288231","https://openalex.org/W2111239386","https://openalex.org/W1552046427","https://openalex.org/W2160046506","https://openalex.org/W104584921","https://openalex.org/W2525946144","https://openalex.org/W206460701","https://openalex.org/W2019219986"],"abstract_inverted_index":{"Our":[0],"main":[1],"result":[2],"in":[3,37,103,109],"this":[4],"paper":[5],"is":[6,49],"a":[7,21,29,57],"parallel":[8,23],"algorithm":[9,35,48],"for":[10,121],"suffix-prefix-":[11],"($s":[12],"-":[13],"p$-)":[14],"matching":[15,55,108],"that":[16],"has":[17],"optimal":[18,101],"speedup":[19,102],"on":[20],"concurrent-read/concurrent-write":[22],"random-access":[24],"machine":[25],"(CRCW":[26],"PRAM).":[27],"Given":[28],"string":[30,73,77,88],"of":[31,106],"length":[32],"m,":[33],"the":[34,70,97,104,114],"runs":[36],"time":[38],"$O(\\log":[39],"m)$":[40],"using":[41],"${m":[42],"/":[43],"{\\log":[44],"m}}$":[45],"processors.":[46],"This":[47],"important":[50],"because":[51],"we":[52],"utilize":[53],"s\u2013p":[54],"as":[56,69],"fundamental":[58],"building":[59],"block":[60],"to":[61,99,118],"solve":[62],"several":[63],"pattern-":[64],"and":[65,94,112],"string-matching":[66],"problems,":[67],"such":[68],"following:":[71],"1.":[72],"matching;":[74,78,82],"2.":[75],"multitext/multipattern":[76],"3.":[79],"multidimensional":[80],"pattern":[81,107],"4.":[83],"pattern-occurrence":[84],"detection;":[85],"5.":[86],"on-line":[87],"matching.":[89],"In":[90],"particular,":[91],"our":[92],"techniques":[93],"algorithms":[95],"are":[96,113],"first":[98],"preserve":[100],"context":[105],"higher":[110],"dimensions":[111,122],"only":[115],"known":[116],"ones":[117],"do":[119],"so":[120],"$d":[123],">":[124],"2$.":[125]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}