New Searching Technique of Hybrid Exact String Matching Algorithm

Abdulrazzaq, Atheer Akram; Rashid, Nur’Aini Abdul; Abu-Hashem, Muhannad A.; Zainol, Zurinahni

doi:10.15866/irecos.v11i10.10321

Cited by 6 publications

(10 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[11]. It is predominantly and broadly utilized in different areas such as web search engine, artificial intelligence [12], [13], remote sensing, aerial photography, cartography, medical diagnostics [1], computational biology [14], compilers, and command interpreters [15]. The persistent challenges of string matching include the duplication of databases each two years, and this affected the speed of computers, which leads to the increment within the size of memory.…”

Section: Related Work 21 Exact String-matching Algorithmmentioning

confidence: 99%

Parallel implementation of maximum-shift algorithm using OpenMp

Abdulrazzaq

Hamad

Taha

2021

IJEECS

Self Cite

View full text Add to dashboard Cite

String matching is considered as one of the center issues within the field of computer science, where there are numerous computer applications that supply the clients with string matching services. The increment within the number of databases which are created and protected in numerous computer gadgets had impacted researchers with the slant towards getting robust techniques in tending to this issue. In this study, the Maximum-Shift string matching algorithm is chosen to be executed with multi-core innovation through the utilization of OpenMP paradigm, in order to decrease the successive time, and increment the speedup and efficiency of the algorithm. The deoxyribonucleic acid (DNA), protein and the English text datasets are utilized to test the parallel execution that influences the Maximum-Shift algorithm execution when utilized with multi-core environment. The results demonstrated that the execution is affected by the performance between the parallel and consecutive execution of Maximum-Shift algorithm by data type. The English text appeared ideal comes about within the parallel execution time as compared to other datasets, whereas the DNA database set appeared the most elevated comes about when compared to other data types in terms of speedup and efficiency capabilities.

show abstract

Section: Related Work 21 Exact String-matching Algorithmmentioning

confidence: 99%

Parallel implementation of maximum-shift algorithm using OpenMp

Abdulrazzaq

Hamad

Taha

2021

IJEECS

Self Cite

View full text Add to dashboard Cite

show abstract

“…As we mentioned previously some of these algorithms used single sliding window to search the text for a certain pattern, while others used two or more sliding windows. On the other hand, some of these algorithms require two phases, pre-processing phase to calculate shift values that used by the sliding window and searching phase [1][2][3][4][5][6][7][8][9][10]. The shift values that the window will shift also varies from one algorithm to another, for example; the shifting values in the BoyerMoore algorithm (BM) [19] in case of a mismatch (or a complete match of the whole pattern) depends on two pre-computed functions to shift the window to the right.…”

Section: Related Workmentioning

confidence: 99%

“…Pattern matching algorithms are used in many applications to search for a certain pattern p of length m in a text t of length n, many algorithms exist that maintain this purpose, but they differ from each other in some aspects such as: Number of sliding windows used in searching process, some algorithms use one window with size equal to pattern size [1][2][3]. Others using two or more sliding windows each with length equal to pattern length [4][5][6][7][8][9].…”

Section: Introductionmentioning

confidence: 99%

“…In this case, the comparisons between the text and two sliding windows happened at the same time at the both sides while other algorithms used four sliding windows [10]. Shift values, the shifting value vary from one algorithm to another, such variations depend on the number of consecutive characters in the text immediately after the pattern window [1][2][3][4][5][6][7][8][9][10]. In this paper, we made an enhancement on the Intelligent Predictive String Search Algorithm [11] [12], while keeping the shift values used in the original Intelligent Predictive String Search Algorithm as it is but we use two sliding window instead of one, the window size is equal pattern size (m), but In this case the two sliding window moves according to the same shift value rules.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Intelligent Predictive String Search Algorithm Using Two Sliding Windows in Parallel Environment

Dababat¹

2020

IJATCSE

View full text Add to dashboard Cite

String matching is a fundamental problem in computer science and has been extensively studied. Searching for all occurrences of a pattern in a text is a fundamental problem in many applications, like natural language processing, information retrieval, pattern recognition and computational biology. Many string matching algorithms are existing and work efficiently with different applications in different life scopes; one of these algorithms is the Intelligent Predictive String Search Algorithm, this algorithm searches through a given text to find the first occurrence of a pattern without a pre-processing phase that included in many string marching algorithms to calculate the pattern shift values which lead less computations and uses simple rules during a match or mismatch of a pattern character using one sliding window.In this paper we updated the Intelligent Predictive String Search Algorithm three times resulting with three versions; in the first one we reversed the search direction to be from right using one sliding window while in second version we use two sliding windows to scans the text from both sides sequentially and finally we parallelize this version using real parallel environment. Besides, it is easy to parallelize the new developed algorithm gain significant enhancement in decreasing time and memory requirements.

show abstract

“…A majority of string matching algorithms enable the reduction on the number of attempts, and the number of character comparison in sequential performance, which however possess weakness in terms of the consumed time. Therefore, the researchers find that it is important to concentrate on the consumed time problems, through the utilization of the parallel processing to address this problem, as it affords the reduction of consumed time in exact string matching algorithms [11].…”

Section: Introductionmentioning

confidence: 99%

Parallel processing of E-Atheer algorithm using pthread paradigm

Abdulrazzaq

Fadhel

Alzubaidi

et al. 2023

IJEECS

View full text Add to dashboard Cite

The development in the field of computer technology, and the increase in the growth rate of database, alongside the extraction of certain data from a huge pool of database involve intricate and complex processes. The processes comprise text mining, pattern recognition, retrieval of information and text processing. Thus, the need for enhancing the performance of string matching algorithms is required, which is considered as one of the challenges to the researchers. Consequently, one of the resolution to address this problem is the parallelization for exact string matching algorithms. In this study, we implemented the parallel exact string matching algorithm termed as E-Atheer with multi-core processing utilizing Pthread (POSIX) for the reduction of time consumption. The Pitch, XML, Protein, and DNA database types are utilized to test the impact of the proposed parallel algorithm. The parallelization algorithm obtained positive results in the parallel execution time, and a more superior expediting capabilities, in comparison to the sequential result. The Pitch database indicated optimal results in parallel execution time, and when utilizing long and short pattern lengths. The DNA database indicated optimal speedup performance when utilizing short and long pattern length, meanwhile the XML and Protein on the other hand indicated the worst results.

show abstract

New Searching Technique of Hybrid Exact String Matching Algorithm

Cited by 6 publications

References 0 publications

Parallel implementation of maximum-shift algorithm using OpenMp

Parallel implementation of maximum-shift algorithm using OpenMp

Intelligent Predictive String Search Algorithm Using Two Sliding Windows in Parallel Environment

Parallel processing of E-Atheer algorithm using pthread paradigm

Contact Info

Product

Resources

About