Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Pattern Recognition ...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Pattern Recognition Letters
Article . 1996 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
https://dx.doi.org/10.1016/016...
Article
Data sources: Microsoft Academic Graph
 View all 1 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

O(1)-time parallel string-matching algorithm with VLDCs

descriptionPublicationkeyboard_double_arrow_right Article 01 May 1996 English Publisher:Elsevier BVJournal:Pattern Recognition Letters, volume 17, pages 475-479 (issn: 0167-8655, Copyright policy )
Authors: Kuo-Liang Chung;

doi: 10.1016/0167-8655(96)00007-4

O(1)-time parallel string-matching algorithm with VLDCs

Abstract

Abstract Given a text of length n and a pattern of length m over a finite alphabet Σ, we consider the string matching (SM) problem with variable length don't cares (VLDCs), where a VLDC (not in Σ) in the pattern can match any substring in the text. This paper presents a first time-optimal parallel SM algorithm with VLDCs. The proposed algorithm can be performed in O(1) time on an m × n mesh-connected computer with a reconfigurable bus system using O( nm ) processors. The previous fastest known parallel SM algorithm takes O(log n ) time on the EREW PRAM model with O( nm /log n ) processors.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 4
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
4
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!
uploadUpload now