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

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखक: Naser, Mustafa Abdulsahib
स्वरूप: थीसिस
भाषा:अंग्रेज़ी
प्रकाशित: 2010
विषय:
ऑनलाइन पहुंच:http://eprints.usm.my/24575/
Abstract Abstract here
_version_ 1855631349038186496
author Naser, Mustafa Abdulsahib
author_facet Naser, Mustafa Abdulsahib
author_sort Naser, Mustafa Abdulsahib
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-10-17T07:58:18Z
format Thesis
id usm-24575
institution Universiti Sains Malaysia
language English
last_indexed 2025-10-17T07:58:18Z
publishDate 2010
record_format EPrints
record_pdf Restricted
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.
thesis_level Master
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/
work_keys_str_mv AT nasermustafaabdulsahib parallelquickskipsearchhybridalgorithmfortheexactstringmatchingproblem