scholarly journals An Efficient Algorithm for 2-Dimensional Pattern Matching Problem

2020 ◽  
Vol 50 (2) ◽  
pp. 295-313
Author(s):  
Sushil Chandra Dimri ◽  
Umesh Kumar Tiwari ◽  
Mangey Ram
Keyword(s):  
Computer Science ◽  
Prime Number ◽  
Pattern Matching ◽  
Efficient Algorithm ◽  
Matching Problem ◽  
Decimal Number ◽  
2D Pattern ◽  
Decimal Numbers ◽  
The Given

AbstractPattern matching is the area of computer science which deals with security and analysis of data. This work proposes two 2D pattern matching algorithms based on two different input domains. The first algorithm is for the case when the given pattern contains only two symbols, that is, binary symbols 0 and 1. The second algorithm is in the case when the given pattern contains decimal numbers, that is, the collection of symbols between 0 and 9. The algorithms proposed in this manuscript convert the given pattern into an equivalent binary or decimal number, correspondingly find the cofactors of the same dimension and convert these cofactors into numbers if a particular cofactor number matches indicate the matching of the pattern. Furthermore, the algorithm is enhanced for decimal numbers. In the case of decimal numbers, each row of the pattern is changed to its decimal equivalent, and then, modulo with a suitable prime number changes the decimal equivalent into a number less than the prime number. If the number mismatched pattern does not exist, the complexity of the proposed algorithm is very low as compared to other traditional algorithms.

scholarly journals An efficient algorithm for the blocked pattern matching problem

2014 ◽  
Vol 31 (4) ◽  
pp. 532-538 ◽  
Author(s):  
Fei Deng ◽  
Lusheng Wang ◽  
Xiaowen Liu
Keyword(s):  
Pattern Matching ◽  
Efficient Algorithm ◽  
Matching Problem

scholarly journals A novel optimal multi-pattern matching method with wildcards for DNA sequence

2021 ◽  
Vol 29 ◽  
pp. 115-124
Author(s):  
Xinlu Wang ◽  
Ahmed A.F. Saif ◽  
Dayou Liu ◽  
Yungang Zhu ◽  
Jon Atli Benediktsson
Keyword(s):  
Dna Sequence ◽  
Pattern Matching ◽  
Health Informatics ◽  
State Of The Art ◽  
Machine Language ◽  
Data Sets ◽  
Fundamental Issue ◽  
Matching Method ◽  
Dna Sequence Alignment ◽  
The Given

BACKGROUND: DNA sequence alignment is one of the most fundamental and important operation to identify which gene family may contain this sequence, pattern matching for DNA sequence has been a fundamental issue in biomedical engineering, biotechnology and health informatics. OBJECTIVE: To solve this problem, this study proposes an optimal multi pattern matching with wildcards for DNA sequence. METHODS: This proposed method packs the patterns and a sliding window of texts, and the window slides along the given packed text, matching against stored packed patterns. RESULTS: Three data sets are used to test the performance of the proposed algorithm, and the algorithm was seen to be more efficient than the competitors because its operation is close to machine language. CONCLUSIONS: Theoretical analysis and experimental results both demonstrate that the proposed method outperforms the state-of-the-art methods and is especially effective for the DNA sequence.

A new algorithm for the small-field astrometric point-pattern matching problem

2018 ◽  
Vol 72 (1) ◽  
pp. 55-70 ◽  
Author(s):  
Cláudio P. Santiago ◽  
Carlile Lavor ◽  
Sérgio Assunção Monteiro ◽  
Alberto Kroner-Martins
Keyword(s):  
Pattern Matching ◽  
Point Pattern ◽  
Small Field ◽  
Matching Problem ◽  
Point Pattern Matching

scholarly journals State Complexity of Neighbourhoods and Approximate Pattern Matching

2018 ◽  
Vol 29 (02) ◽  
pp. 315-329 ◽  
Author(s):  
Timothy Ng ◽  
David Rappaport ◽  
Kai Salomaa
Keyword(s):  
Lower Bound ◽  
Pattern Matching ◽  
Finite Automaton ◽  
The State ◽  
Worst Case ◽  
State Complexity ◽  
Approximate Pattern Matching ◽  
The Given ◽  
Nondeterministic Finite Automaton ◽  
Distance Formula

The neighbourhood of a language [Formula: see text] with respect to an additive distance consists of all strings that have distance at most the given radius from some string of [Formula: see text]. We show that the worst case deterministic state complexity of a radius [Formula: see text] neighbourhood of a language recognized by an [Formula: see text] state nondeterministic finite automaton [Formula: see text] is [Formula: see text]. In the case where [Formula: see text] is deterministic we get the same lower bound for the state complexity of the neighbourhood if we use an additive quasi-distance. The lower bound constructions use an alphabet of size linear in [Formula: see text]. We show that the worst case state complexity of the set of strings that contain a substring within distance [Formula: see text] from a string recognized by [Formula: see text] is [Formula: see text].

Introduction and Implementation of Machine Learning Algorithms in R

2019 ◽  
pp. 126-147
Author(s):  
S. R. Mani Sekhar ◽  
G. M. Siddesh
Keyword(s):  
Machine Learning ◽  
Neural Networks ◽  
Support Vector Machine ◽  
Discriminant Analysis ◽  
Computer Science ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Linear Discriminant ◽  
The Given

Machine learning is one of the important areas in the field of computer science. It helps to provide an optimized solution for the real-world problems by using past knowledge or previous experience data. There are different types of machine learning algorithms present in computer science. This chapter provides the overview of some selected machine learning algorithms such as linear regression, linear discriminant analysis, support vector machine, naive Bayes classifier, neural networks, and decision trees. Each of these methods is illustrated in detail with an example and R code, which in turn assists the reader to generate their own solutions for the given problems.

scholarly journals An Efficient Algorithm for LCS Problem between Two Arbitrary Sequences

2018 ◽  
Vol 2018 ◽  
pp. 1-6
Author(s):  
Yubo Li
Keyword(s):  
Computer Science ◽  
Efficient Algorithm ◽  
Longest Common Subsequence ◽  
Common Subsequence ◽  
Science Problem ◽  
Essential Problem

The longest common subsequence (LCS) problem is a classic computer science problem. For the essential problem of computing LCS between two arbitrary sequences s1 and s2, this paper proposes an algorithm taking O(n+r) space and O(r+n2) time, where r is the total number of elements in the set (i,j)|s1[i]=s2[j]. The algorithm can be more efficient than relevant classical algorithms in specific ranges of r.

Sign in / Sign up

Export Citation Format

Share Document