scholarly journals Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP

2016 ◽  
Vol 04 (13) ◽  
pp. 1-11 ◽  
Author(s):  
Sinan Sameer Mahmood Al-Dabbagh ◽  
Nawaf Hazim Barnouti ◽  
Mustafa Abdul Sahib Naser ◽  
Zaid G. Ali
Keyword(s):  
Search Algorithm ◽  
String Matching ◽  
Matching Problem ◽  
Quick Search

A New Algorithm for Subset Matching Problem Based on Set-String Transformation

2009 ◽  
pp. 607-615
Author(s):  
Yangjun Chen
Keyword(s):  
Programming Languages ◽  
Linear Time ◽  
String Matching ◽  
Special Problem ◽  
Computer Engineering ◽  
Data Types ◽  
Matching Problem ◽  
Matching Problems ◽  
Abstract Data ◽  
Geometric Pattern Matching

In computer engineering, a number of programming tasks involve a special problem, the so-called tree matching problem (Cole & Hariharan, 1997), as a crucial step, such as the design of interpreters for nonprocedural programming languages, automatic implementation of abstract data types, code optimization in compilers, symbolic computation, context searching in structure editors and automatic theorem proving. Recently, it has been shown that this problem can be transformed in linear time to another problem, the so called subset matching problem (Cole & Hariharan, 2002, 2003), which is to find all occurrences of a pattern string p of length m in a text string t of length n, where each pattern and text position is a set of characters drawn from some alphabet S. The pattern is said to occur at text position i if the set p[j] is a subset of the set t[i + j - 1], for all j (1 = j = m). This is a generalization of the ordinary string matching and is of interest since an efficient algorithm for this problem implies an efficient solution to the tree matching problem. In addition, as shown in (Indyk, 1997), this problem can also be used to solve general string matching and counting matching (Muthukrishan, 1997; Muthukrishan & Palem, 1994), and enables us to design efficient algorithms for several geometric pattern matching problems. In this article, we propose a new algorithm on this issue, which needs only O(n + m) time in the case that the size of S is small and O(n + m·n0.5) time on average in general cases.

scholarly journals Dictionary Of Psychology With Horspool Algorithm

2018 ◽  
Vol 1 (1) ◽  
pp. 078-084
Author(s):  
Ade Mutiara Kartika ◽  
Poltak Sihombing ◽  
Ade Candra
Keyword(s):  
Data Storage ◽  
Search Algorithm ◽  
String Matching ◽  
Search Results ◽  
General Terms ◽  
Psychological Term ◽  
Search Information ◽  
Research Show

Dictionary is a reference that contains words and phrases that are usually sorted alphabetically and is followed by a description of the word or phrase. Dictionary consists of several types, one of which is a dictionary of terms. Psychology dictionary is a dictionary of terms that contain psychological term. Psychology dictionary is identical to the old tome in search and less efficient in its use. Made an Android-based application of psychology dictionary that applies the Horspool algorithm for terms search and SQLite for data storage is a solution. The search algorithm is needed to shorten the time in the search itself. Horspool algorithm apply a saved search information to shift even further because the string matching is done from right to left, so the time to search a string is shorter. Fields used in this research is psychology in general terms. By entering a psychological term as input in the search then we will get the search results. The results of this research show the entire pattern that matches the text.  

scholarly journals Penerapan Algoritma Horspool pada Aplikasi Katalog Buku Perpustakaan

2019 ◽  
Vol 1 ◽  
pp. 881
Author(s):  
Fince Tinus Waruwu ◽  
Rivalri Kristianto Hondro
Keyword(s):  
Reference Material ◽  
General Public ◽  
Search Algorithm ◽  
String Matching ◽  
Search Algorithms ◽  
Library Services ◽  
Search Process ◽  
Library Book ◽  
Long Time ◽  
Time And Energy

The library is a place that provides various types of reading books as reference material for students, students, educators and the general public. The library certainly provides various types of books that are different according to their needs. Finding books that are needed in a library with a large number of books certainly takes a long time and energy. In supporting library services and providing convenience for visitors, an application is built that helps visitors find the books they need to not need a long time and effort. In the book catalog application it is necessary to apply a search algorithm (string matching). Search algorithms help enders in finding the books they need. The search algorithm applied to the library book catalog application is the Horspool algorithm. Horspool algorithm is one algorithm that is widely used in the search process. By applying the Horspool algorithm in the library book catalog application can be faster and facilitate the process of finding the title of the book.

scholarly journals On the Comparison Complexity of the String Prefix-Matching Problem

1995 ◽  
Vol 2 (46) ◽  
Author(s):  
Dany Breslauer ◽  
Livio Colussi ◽  
Laura Toniolo
Keyword(s):  
Linear Time ◽  
String Matching ◽  
Random Access ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Matching Problem ◽  
Machine Model ◽  
Worst Case ◽  
On Line ◽  
Sequential Comparison

In this paper we study the exact comparison complexity of the string<br />prefix-matching problem in the deterministic sequential comparison model<br />with equality tests. We derive almost tight lower and upper bounds on<br />the number of symbol comparisons required in the worst case by on-line<br />prefix-matching algorithms for any fixed pattern and variable text. Unlike<br />previous results on the comparison complexity of string-matching and<br />prefix-matching algorithms, our bounds are almost tight for any particular pattern.<br />We also consider the special case where the pattern and the text are the<br />same string. This problem, which we call the string self-prefix problem, is<br />similar to the pattern preprocessing step of the Knuth-Morris-Pratt string-matching<br />algorithm that is used in several comparison efficient string-matching<br />and prefix-matching algorithms, including in our new algorithm.<br />We obtain roughly tight lower and upper bounds on the number of symbol<br />comparisons required in the worst case by on-line self-prefix algorithms.<br />Our algorithms can be implemented in linear time and space in the<br />standard uniform-cost random-access-machine model.

scholarly journals A Faster Quick Search Algorithm

Algorithms ◽  
2014 ◽  
Vol 7 (2) ◽  
pp. 253-275 ◽  
Author(s):  
Jie Lin ◽  
Donald Adjeroh ◽  
Yue Jiang
Keyword(s):  
Search Algorithm ◽  
Quick Search

Approximate Chinese String Matching Techniques Based on Pinyin Input Method

2014 ◽  
Vol 513-517 ◽  
pp. 1017-1020
Author(s):  
Bing Liu ◽  
Dan Han ◽  
Shuang Zhang
Keyword(s):  
Computer Science ◽  
Rapid Development ◽  
String Matching ◽  
Approximate String Matching ◽  
Chinese Characters ◽  
Matching Problem ◽  
Input Method ◽  
Large Size ◽  
Matching Techniques ◽  
Research And Design

String matching is one of the most typical problems in computer science. Previous studies mainly focused on accurate string matching problem. However, with the rapid development of the computer and Internet as well as the continuously rising of new issues, people find that it has very important theoretical value and practical meaning to research and design efficient approximate string matching algorithms. Approximate string matching is also called string matching that allows errors, which mainly aims to find the pattern string in the text and database and allows k differences between the pattern string and its occurring forms in the text. For the problem of approximate string matching, though a number of algorithms have been proposed, there are fewer studies which focus on large size of alphabet . Most of experts are interested in small or middle size of alphabet . For large size of , especially for Chinese characters and Asian phonetics, there are fewer efficient algorithms. For the above reasons, this paper focuses on the approximate Chinese strings matching problem based on the pinyin input method.

Rapid Search Algorithms of Local Registering Based on Decimal Tree

2013 ◽  
Vol 325-326 ◽  
pp. 1535-1538
Author(s):  
Zhen Hua Xia
Keyword(s):  
Search Algorithm ◽  
String Matching ◽  
Search Algorithms ◽  
Phone Number ◽  
Low Efficiency ◽  
Algorithm Implementation

In order to overcome the low efficiency of the database-based algorithm and the string-matching based algorithm in searching phone number, the two-level search algorithm by combining a decimal tree with a local registering table is proposed in this paper. The algorithm implementation is introduced in detail, and the experiments show that the decimal tree based algorithm is faster than the database-based algorithm and the string-matching based algorithm, especially much faster in the case of huge traffic.

Sign in / Sign up

Export Citation Format

Share Document