Occurrences Algorithm for String Searching Based on Brute-force Algorithm

Ababneh, Mohammad; Oqeili, Saleh; Abdeen, Rawan Ali

doi:10.3844/jcssp.2006.82.85

Cited by 41 publications

(16 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The secret text is converted into the representation of the American Standard Code for Information Interchange (ASCII). The algorithm Brute Force is used to determine matches between the RGB decimal frames and the secret text [22]. The brute force is one of the patterns matching algorithms.…”

Section: Finding the Exact Matching (Em) Between The Frames And The Smentioning

confidence: 99%

See 1 more Smart Citation

UN-Substituted Video Steganography

2020

KSII TIIS

View full text Add to dashboard Cite

Steganography is the art of concealing the existence of a secret data in a non-secret digital carrier called cover media. While the image of steganography methods is extensively researched, studies on other cover files remain limited. Videos are promising research items for steganography primitives. This study presents an improved approach to video steganography. The improvement is achieved by allowing senders and receivers exchanging secret data without embedding the hidden data in the cover file as in traditional steganography methods. The method is based mainly on searching for exact matches between the secret text and the video frames RGB channel pixel values. Accordingly, a random key-dependent data is generated, and Elliptic Curve Public Key Cryptography is used. The proposed method has an unlimited embedding capacity. The results show that the improved method is secure against traditional steganography attacks since the cover file has no embedded data. Compared to other existing Steganography video systems, the proposed system shows that the method proposed is unlimited in its embedding capacity, system invisibility, and robustness. The system achieves high precision for data recovery in the receiver. The performance of the proposed method is found to be acceptable across different sizes of video files.

show abstract

Section: Finding the Exact Matching (Em) Between The Frames And The Smentioning

confidence: 99%

“…The algorithm of brute force is used to determine the matches between the decimal RGB frames and the secret text. The following are the main features of the brute force algorithm [22]:…”

Section: Finding the Exact Matching (Em) Between The Frames And The Smentioning

confidence: 99%

UN-Substituted Video Steganography

2020

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…On the bases of brute force pattern searching scheme another algorithm proponed named as Occurrences algorithm [3]. Approach of occurrence algorithm is to compare text and pattern character by character.…”

Section: Related Workmentioning

confidence: 99%

“…Modified word searching algorithm (MWSA) [2], Occurrence algorithms [3], Word searching algorithm (WSA) [1], and many more algorithms have been proposed to solve pattern searching`s problems. The main problems with these existing algorithms are search time and space overhead.…”

Section: Introductionmentioning

confidence: 99%

Efficient single pattern searching algorithm for offline text by using binary search tree (ESPS Algorithm)

Mishra

Pandey

Astya

2015

International Conference on Computing, Communication &Amp; Automation

View full text Add to dashboard Cite

To retrieve all recurrence of the pattern in offline text, pattern searching techniques are used. Two processes would be carried out in our approach, first process would be preprocessing and second process would be searching process. Pattern searching algorithms consists of problems with searching space and time overhead. The efficiency of proposed algorithm is improved by adopting binary search tree and SDBM hash function techniques. These techniques are applied to make fast the search time to find a unique key for each pattern in the text.

show abstract

“…After the texts in the window are arranged in lines, the characters in the text are compared with a pattern until a match is found. During the searching phase, there would be either a match or mismatch as is normally the case, such that the window is shifted to the rightmost section for the alignment of text which begins from left to right at the beginning of the search (Mohammad et al, 2006).…”

Section: Introductionmentioning

confidence: 99%

A Fast Hybrid Algorithm for the Exact String Matching Problem

Al-mazroi¹

2011

American Journal of Engineering and Applied Sciences

View full text Add to dashboard Cite

Problem statement: Due to huge amount and complicated nature of data being generated recently, the usage of one algorithm for string searching was not sufficient to ensure faster search and matching of patterns. So there is the urgent need to integrate two or more algorithms to form a hybrid algorithm (called BRSS) to ensure speedy results. Approach: This study proposes the combination of two algorithms namely Berry-Ravindran and Skip Search Algorithms to form a hybrid algorithm in order to boost search performance. Results: The proposed hybrid algorithm contributes to better results by reducing the number of attempts, number of character comparisons and searching time. The performance of the hybrid was tested using different types of data-DNA, Protein and English text. The percentage of the improvements of the hybrid algorithm compared to Berry-Ravindran in DNA, Protein and English text are 50%, 43% and 44% respectively. The percentage of the improvements over Skip Search algorithm in DNA, Protein and English text are 20%, 30% and 18% respectively. The criteria applied for evaluation are number of attempts, number of character comparisons and searching time. Conclusion: The study shows how the integration of two algorithms gives better results than the original algorithms even the same data size and pattern lengths are applied as test evaluation on each of the algorithms.

show abstract

Occurrences Algorithm for String Searching Based on Brute-force Algorithm

Abstract: This study proposes a string searching algorithm as an improvement of the brute-force searching algorithm. The algorithm is named as, Occurrences algorithm. It is based on performing preprocessing for the pattern and for the text before beginning to search for the pattern in the text.

Cited by 41 publications

References 1 publication

UN-Substituted Video Steganography

UN-Substituted Video Steganography

Efficient single pattern searching algorithm for offline text by using binary search tree (ESPS Algorithm)

A Fast Hybrid Algorithm for the Exact String Matching Problem

Contact Info

Product

Resources

About