✦ LIBER ✦

A pipelined processor architecture for regular expression string matching

✍ Scribed by Qiyue Li; Jie Li; Jianping Wang; Baohua Zhao; Yugui Qu

Book ID: 119326412
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 630 KB
Volume: 36
Category: Article
ISSN: 0141-9331
DOI: 10.1016/j.micpro.2012.04.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pipelined Architecture for Multi-String

Pipelined Architecture for Multi-String Matching

✍ Derek Pao; Wei Lin; Bin Liu 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 116 KB

A programmable array processor architect

A programmable array processor architecture for flexible approximate string matching algorithms

✍ Panagiotis D. Michailidis; Konstantinos G. Margaritis 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 277 KB

A VLSI architecture for pipeline fft pro

A VLSI architecture for pipeline fft processor

✍ Yukio Takahashi; Satoshi Sekine 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 813 KB

An associative string processor architec

An associative string processor architecture for parallel processing applications

✍ A Krikelis; R.M Lea 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 856 KB

A compact function for regular expressio

A compact function for regular expression pattern matching

✍ Martin Richards 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB

A Subquadratic Algorithm for Approximate

A Subquadratic Algorithm for Approximate Regular Expression Matching

✍ S. Wu; U. Manber; E. Myers 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 673 KB

The main result of this paper is an algorithm for approximate matching of a regular expression of size \(m\) in a text of size \(n\) in time \(O\left(n m / \log _{d+2} n\right)\), where \(d\) is the number of allowed errors. This algorithm is the first \(o(m n)\) algorithm for approximate matching t