Login | Create Account
   

Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.

Naser, Mustafa Abdulsahib (2010) Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem. Masters thesis, USM.

[img]PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
423Kb

Abstract

Masalah padanan rententan merupakan mercu tanda dalam kebanyakan bidang sains komputer kerana peranan yang dimainkannya dalam pelbagai aplikasi komputer. The string matching problem occupies a corner stone in many computer science fields because of the fundamental role it plays in various computer applications.

Item Type:Thesis (Masters)
Subjects:Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
ID Code:24575
Deposited By:Mr Firdaus Mohamad
Deposited On:20 Feb 2012 10:36
Last Modified:20 Feb 2012 10:36

Repository Staff Only: item control page

USM is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.
Share