Laboulbeniales on Semi-aquatic Hemiptera. Laboulbenia.

  • Benjamin R
N/ACitations
Citations of this article
37Readers
Mendeley users who have this article in their library.

Abstract

Table-driven (TD) DFA-based string processing algorithms are examined from a number of vantage points. Firstly, various strategies for implementing such algorithms in a cache-efficient manner are identified. The denotational semantics of such algorithms is encapsulated in a function whose various arguments are associated with each implementation strategy. This formal view of the implementation strategies suggests twelve different algorithms, each blending together the implementation strategies in a particular way. The performance of these algorithms is examined in against a set of artificially generated data. Results indicate a number of cases where the new algorithms outperform the traditional TD algorithm. © 2006 Czech Technical University in Prague, Czech Republic.

Cite

CITATION STYLE

APA

Benjamin, R. (1967). Laboulbeniales on Semi-aquatic Hemiptera. Laboulbenia. Aliso, 6(3), 111–136. https://doi.org/10.5642/aliso.19670603.07

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free