Parallel algorithms for string matching problem on single and two dimensional reconfigurable pipelined bus systems.: An article from: Journal of Computer Science

This digital document is an article from Journal of Computer Science, published by Science Publications on September 1, 2007. The length of the article is 4287 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available immediately after purchase. You can view it with any web browser.

From the author: Keywords: Hamming Distance, LARPBS, PRAM, Reconfigurability, string matching

Citation Details
Title: Parallel algorithms for string matching problem on single and two dimensional reconfigurable pipelined bus systems.
Author: S. Viswanadha Raju
Publication:Journal of Computer Science (Magazine/Journal)
Date: September 1, 2007
Publisher: Science Publications
Volume: 3 Issue: 9 Page: 754(6)

Distributed by Gale, a part of Cengage Learning