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

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 compute...

Full description

Bibliographic Details
Main Author: Naser, Mustafa Abdulsahib
Format: Thesis
Language:English
Published: 2010
Subjects:
Online Access:http://eprints.usm.my/24575/
http://eprints.usm.my/24575/1/PARALLEL_QUICK_SKIP_SEARCH_HYBRID_ALGORITHM_FOR_THE_EXACT_STRING_MATCHING_PROBLEM.pdf
_version_ 1848874889436463104
author Naser, Mustafa Abdulsahib
author_facet Naser, Mustafa Abdulsahib
author_sort Naser, Mustafa Abdulsahib
building USM Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-15T16:34:56Z
format Thesis
id usm-24575
institution Universiti Sains Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T16:34:56Z
publishDate 2010
recordtype eprints
repository_type Digital Repository
spelling usm-245752013-07-13T09:43:59Z http://eprints.usm.my/24575/ Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem. Naser, Mustafa Abdulsahib QA75.5-76.95 Electronic computers. Computer science 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. 2010-01 Thesis NonPeerReviewed application/pdf en http://eprints.usm.my/24575/1/PARALLEL_QUICK_SKIP_SEARCH_HYBRID_ALGORITHM_FOR_THE_EXACT_STRING_MATCHING_PROBLEM.pdf Naser, Mustafa Abdulsahib (2010) Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem. Masters thesis, USM.
spellingShingle QA75.5-76.95 Electronic computers. Computer science
Naser, Mustafa Abdulsahib
Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
title Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
title_full Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
title_fullStr Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
title_full_unstemmed Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
title_short Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
title_sort parallel quick-skip search hybrid algorithm for the exact string matching problem.
topic QA75.5-76.95 Electronic computers. Computer science
url http://eprints.usm.my/24575/
http://eprints.usm.my/24575/1/PARALLEL_QUICK_SKIP_SEARCH_HYBRID_ALGORITHM_FOR_THE_EXACT_STRING_MATCHING_PROBLEM.pdf