{"id":"https://openalex.org/W2073811201","doi":"https://doi.org/10.1080/10637199708915586","title":"A VLSI PROCESSOR ARRAY FOR FLEXIBLE STRING MATCHING","display_name":"A VLSI PROCESSOR ARRAY FOR FLEXIBLE STRING MATCHING","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2073811201","doi":"https://doi.org/10.1080/10637199708915586","mag":"2073811201"},"language":"en","primary_location":{"id":"doi:10.1080/10637199708915586","doi":"https://doi.org/10.1080/10637199708915586","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199708915586","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-20","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5047927312","display_name":"Konstantinos G. Margaritis","orcid":"https://orcid.org/0000-0002-1750-5115","observed_orcids":["https://orcid.org/0000-0002-1750-5115"]},"institutions":[{"id":"https://openalex.org/I192756129","display_name":"University of Macedonia","ror":"https://ror.org/05fg6gr82","country_code":"GR","type":"education","lineage":["https://openalex.org/I192756129"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"K. G. MARGARITIS","raw_affiliation_strings":["Department of Informatics, University of Macedonia, P.O. BOX 1591, 54006, Thessaloniki, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Macedonia, P.O. BOX 1591, 54006, Thessaloniki, Greece","institution_ids":["https://openalex.org/I192756129"]}]},{"author_position":"last","author":{"id":null,"display_name":"D. J. EVANS","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"D. J. EVANS","raw_affiliation_strings":["Parallel Algorithms Research Centre, Department of Computer Studies, Loughborough University, Leicestershire LEII 3TU, U.K"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Parallel Algorithms Research Centre, Department of Computer Studies, Loughborough University, Leicestershire LEII 3TU, U.K","institution_ids":["https://openalex.org/I143804889"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"1-2","first_page":"45","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9071999788284302,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9071999788284302,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.06080000102519989,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.010200000368058681,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/systolic-arrays","display_name":"systolic arrays","score":0.6129999756813049},{"id":"https://openalex.org/keywords/vlsi-processor-arrays","display_name":"VLSI processor arrays","score":0.9739999771118164},{"id":"https://openalex.org/keywords/approximate-pattern-matching","display_name":"approximate pattern matching","score":0.7739999890327454},{"id":"https://openalex.org/keywords/string-matching-algorithms","display_name":"string matching algorithms","score":0.5379999876022339},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.33399999141693115}],"concepts":[{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.8689574003219604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6938563585281372},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.6850369572639465},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.6320645809173584},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6048046946525574},{"id":"https://openalex.org/C150741067","wikidata":"https://www.wikidata.org/wiki/Q2377218","display_name":"Systolic array","level":3,"score":0.6030384302139282},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6006932854652405},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5929265022277832},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5287789106369019},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.46787118911743164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42465662956237793},{"id":"https://openalex.org/C2776189500","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Processor array","level":2,"score":0.4237125515937805},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2710610032081604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18609508872032166},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.13783159852027893},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11105698347091675},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199708915586","doi":"https://doi.org/10.1080/10637199708915586","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199708915586","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-20","russia-white-list-2"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1502325900","https://openalex.org/W1528203732","https://openalex.org/W1666015432","https://openalex.org/W1970707909","https://openalex.org/W1973959475","https://openalex.org/W1976043380","https://openalex.org/W1981409766","https://openalex.org/W1997669059","https://openalex.org/W2001956015","https://openalex.org/W2005233665","https://openalex.org/W2011632873","https://openalex.org/W2017369466","https://openalex.org/W2034363187","https://openalex.org/W2045821558","https://openalex.org/W2052899946","https://openalex.org/W2053767428","https://openalex.org/W2082518165","https://openalex.org/W2091104536","https://openalex.org/W2097493185","https://openalex.org/W2100034399","https://openalex.org/W2125097905","https://openalex.org/W2142574874","https://openalex.org/W2165224873","https://openalex.org/W2169989083","https://openalex.org/W2170963144"],"related_works":["https://openalex.org/W1983935318","https://openalex.org/W2096375755","https://openalex.org/W1967700310","https://openalex.org/W7099787336","https://openalex.org/W4230360791","https://openalex.org/W7100121764","https://openalex.org/W2129264134","https://openalex.org/W2028628824","https://openalex.org/W2170931923","https://openalex.org/W2008390219"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,11,26,45,56],"systolic":[4,46],"design":[5],"for":[6,63],"flexible":[7],"string":[8,64],"matching.":[9,65],"Initially":[10],"sequential":[12],"algorithm":[13,32,47],"is":[14,33,48,70],"discussed":[15],"which":[16,50],"consists":[17],"of":[18,30,41],"two":[19],"phases,":[20],"i.e.":[21],"pre-processing":[22,68],"and":[23,25],"searching,":[24],"matrix":[27],"vector":[28],"notation":[29],"the":[31,38,42,67,74],"proposed.":[34],"Then,":[35],"starting":[36],"from":[37],"computational":[39],"schedule":[40],"searching":[43],"phase":[44,69],"derived":[49],"can":[51],"be":[52],"realised":[53],"directly":[54],"onto":[55,73],"special":[57],"purpose":[58],"VLSI":[59,76],"processor":[60],"array":[61],"architecture":[62],"Further":[66],"also":[71],"accommodated":[72],"same":[75],"design.":[77],"Finally":[78],"extensions":[79],"to":[80],"approximate":[81],"pattern":[82],"matching":[83],"are":[84],"discussed.":[85]},"counts_by_year":[],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}