A Memory-Efficient Deterministic Finite Automaton-Based Bit-Split String Matching Scheme Using Pattern Uniqueness in Deep Packet Inspection

PLoS ONE- United States

doi 10.1371/journal.pone.0126517

Full Text

Abstract

Available in

Date

Authors

Publisher

Public Library of Science (PLoS)

Related search

Fast and Memory-Efficient Traffic Classification With Deep Packet Inspection in CMP Architecture

2010English

Maxmin- $$\Omega $$ : A Simple Deterministic Asynchronous Cellular Automaton Scheme

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016Romanian

Nested Counters in Bit-Parallel String Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Spam Filtering Through Multiple Pattern Bit Parallel String Matching Combining Shift AND & Or

International Journal of Computer Applications
2013English

Pattern Matching in Link Streams: Timed-Automata With Finite Memory

Scientific Annals of Computer Science
Applied MathematicsComputer Science
2018English

A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1999English

Reliable and Efficient PUF-based Key Generation Using Pattern Matching

2011English

A Memory Efficient Hardware Based Pattern Matching and Protein Alignment Schemes for Highly Complex Databases

International Journal on Smart Sensing and Intelligent Systems
ControlSystems EngineeringElectricalElectronic Engineering
2017English

New and Efficient Recursive-Based String Matching Algorithm (RSMA-FLFC)

International Journal of Computer Applications
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy