scholarly journals Entropy-Based Approach in Selection Exact String-Matching Algorithms

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 31
Author(s):  
Ivan Markić ◽  
Maja Štula ◽  
Marija Zorić ◽  
Darko Stipaničev
Keyword(s):  
String Matching ◽  
Quantitative Measure ◽  
Search Pattern ◽  
Maximum Efficiency ◽  
Resource Usage ◽  
Specific Domain ◽  
Matching Problems ◽  
Algorithm Efficiency ◽  
Testing Algorithm ◽  
Algorithm Implementation

The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case. Expressing, measuring, and testing algorithm efficiency is a challenging task with many potential pitfalls. Algorithm efficiency can be measured based on the usage of different resources. In software engineering, algorithmic productivity is a property of an algorithm execution identified with the computational resources the algorithm consumes. Resource usage in algorithm execution could be determined, and for maximum efficiency, the goal is to minimize resource usage. Guided by the fact that standard measures of algorithm efficiency, such as execution time, directly depend on the number of executed actions. Without touching the problematics of computer power consumption or memory, which also depends on the algorithm type and the techniques used in algorithm development, we have developed a methodology which enables the researchers to choose an efficient algorithm for a specific domain. String searching algorithms efficiency is usually observed independently from the domain texts being searched. This research paper aims to present the idea that algorithm efficiency depends on the properties of searched string and properties of the texts being searched, accompanied by the theoretical analysis of the proposed approach. In the proposed methodology, algorithm efficiency is expressed through character comparison count metrics. The character comparison count metrics is a formal quantitative measure independent of algorithm implementation subtleties and computer platform differences. The model is developed for a particular problem domain by using appropriate domain data (patterns and texts) and provides for a specific domain the ranking of algorithms according to the patterns’ entropy. The proposed approach is limited to on-line exact string-matching problems based on information entropy for a search pattern. Meticulous empirical testing depicts the methodology implementation and purports soundness of the methodology.

scholarly journals Algorithm Implementation Crochemore Perrin On The Dictionary Application Of Latin Terms Flora And Fauna Based On Android

2020 ◽  
Vol 2 (1) ◽  
pp. 140-148
Author(s):  
Bobby Aris Sandy ◽  
Paska Marto Hasugian
Keyword(s):  
String Matching ◽  
Smartphone Application ◽  
Search Method ◽  
Search Process ◽  
Smartphone Applications ◽  
Matching Process ◽  
Data Search ◽  
String Search ◽  
Algorithm Implementation ◽  
Very High

Searching is the process of selecting the information needed from a collection of data that already exists, data search is often also called a tablelook-up or store and retrieval information. Along with the development of technology that is now so very rapid, one of them is the Smartphone application. Smartphone applications that are currently in demand are increasing sharply, that is Android. Even though the presentation is limited to the screen, Smartphones are quite efficient for its users where the mobility is very high and affordable in all circles of society. used is the string search method. String search method is a string search process or often also called string matching. In the string matching process, there is the Crochemore perrin algorithm, which is an algorithm that factoring a pattern into two parts, namely Pattrenkiri and pattern right. This method is perfect for dictionary search applications of Latin terms flora and fauna.

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.

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.

STRING MATCHING ARTIFICIAL NEURAL NETWORKS

2001 ◽  
Vol 11 (05) ◽  
pp. 445-453 ◽  
Author(s):  
TATIANA TAMBOURATZIS
Keyword(s):  
Neural Networks ◽  
Artificial Neural Networks ◽  
Computational Complexity ◽  
Building Block ◽  
String Matching ◽  
Matching Problems ◽  
Low Computational Complexity ◽  
Artificial Neural ◽  
Harmony Theory ◽  
Fast Match

Three artificial neural networks (ANNs) are proposed for solving a variety of on- and off-line string matching problems. The ANN structure employed as the building block of these ANNs is derived from the harmony theory (HT) ANN, whereby the resulting string matching ANNs are characterized by fast match-mismatch decisions, low computational complexity, and activation values of the ANN output nodes that can be used as indicators of substitution, insertion (addition) and deletion spelling errors.

scholarly journals String matching problems over free partially commutative monoids

1992 ◽  
Vol 101 (2) ◽  
pp. 131-149 ◽  
Author(s):  
Kosaburo Hashiguchi ◽  
Kazuya Yamada
Keyword(s):  
String Matching ◽  
Commutative Monoids ◽  
Matching Problems

Knowledge sharing: an innovative organizational approach to engage volunteers

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Monica Fait ◽  
Georgia Sakka
Keyword(s):  
Nonprofit Organizations ◽  
Knowledge Sharing ◽  
Sense Of Belonging ◽  
Design Methodology ◽  
Well Being ◽  
Maximum Efficiency ◽  
Specific Domain ◽  
Psychological Well Being ◽  
Content Type ◽  
Sharing Strategy

PurposeA profound managerial transformation approach is increasingly designed to unleash the energy and creativity of employees. The purpose of this paper is to observe as the organizations in this sector can use the knowledge sharing to derive maximum efficiency from such crucial volunteers, creating an environment suitable for stimulating the psychological well-being that is the basis of engagement.Design/methodology/approachThis exploratory study proposes a model to account the intrinsic and extrinsic motivations to exchange knowledge related to factors that stimulate volunteer's engagement.FindingsThe results of a survey of 301 volunteers operating in European organizations indicate that influencers of volunteers in a specific domain activated by knowledge sharing can act as sources of creation and can reinforce their identity, sense of belonging and trust in the organization.Research limitations/implicationsDespite results cannot be generalized because of the samples of convenience, exploratory factor analysis was used to identify the elements for which nonprofit organizations should activate a knowledge-sharing strategy so that engaged volunteers feel like cocreators of values and therefore act as true competitive assets.Originality/valueThis paper contributes to the expansion of engagement studies through framing the motivations of volunteers in knowledge sharing as a process of social interaction that involves knowledge, experience and expertise and which is able to create an environment suitable to feeding the psychological well-being that is the basis of engagement.

Sign in / Sign up

Export Citation Format

Share Document