You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

The Practical Efficiency of Convolutions in Pattern Matching Algorithms

Issue title: Workshop on Combinatorial Algorithms

Article type: Research Article

Authors: Amir, Amihood | Levy, Avivit | Reuveni, Liron

Affiliations: Department of Computer Science, Bar-Ilan University, 52900 Ramat-Gan, Israel. E-mails: [email protected]; [email protected]; [email protected]

Abstract: Convolutions have proven to be an effective tool in asymptotically efficient pattern matching algorithms. This study attempts to find the type of problems where convolutions are inefficient in practice, and give possible solutions for the complex cases where the convolution method does not seem to aid realistic sized inputs.

Journal: Fundamenta Informaticae, vol. 84, no. 1, pp. 1-15, 2008

Received 16 June 2008
|
Accepted 16 June 2008
|
Published: 2008
Price: EUR 27.50
Show more