A New String Matching Algorithm

Ahmed, Mustaq; Kaykobad, M.; Chowdhury, Rezaul

doi:10.1080/0020716031000087113

Cited by 6 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The information in this array is used to determine the number of characters to be skipped. AKC algorithm [11], [89] is a modification of the algorithms in [39]. Characters within windows are scanned from right to left.…”

Section: E Hybrid Approachmentioning

confidence: 99%

Exact String Matching Algorithms: Survey, Issues, and Future Research Directions

et al. 2019

View full text Add to dashboard Cite

String matching has been an extensively studied research domain in the past two decades due to its various applications in the fields of text, image, signal, and speech processing. As a result, choosing an appropriate string matching algorithm for current applications and addressing challenges is difficult. Understanding different string matching approaches (such as exact string matching and approximate string matching algorithms), integrating several algorithms, and modifying algorithms to address related issues are also difficult. This paper presents a survey on single-pattern exact string matching algorithms. The main purpose of this survey is to propose new classification, identify new directions and highlight the possible challenges, current trends, and future works in the area of string matching algorithms with a core focus on exact string matching algorithms.

show abstract

Section: E Hybrid Approachmentioning

confidence: 99%

Exact String Matching Algorithms: Survey, Issues, and Future Research Directions

et al. 2019

View full text Add to dashboard Cite

show abstract

“…Appeared in [80] First linear algorithm scanning the text and the pattern from left to right. It derives from (1). Preprocessing of the pattern in O(m)-time and -space.…”

Section: List Of Algorithms Based On Comparison Of Charactersmentioning

confidence: 99%

“…Appeared in [1] A variant of (7) that remembers all the suffixes of the pattern found in the text and that computes the shifts accordingly at the end of each attempt.…”

Section: Ahmed-kaykobad-chowdhury (Akc) -2003mentioning

confidence: 99%

See 1 more Smart Citation

The exact online string matching problem

2013

View full text Add to dashboard Cite

In this short note we present a comprehensive bibliography for the online exact string matching problem. The problem consists in finding all occurrences of a given pattern in a text. It is an extensively studied problem in computer science, mainly due to its direct applications to such diverse areas as text, image and signal processing, speech analysis and recognition, data compression, information retrieval, computational biology and chemistry. Since 1970 more than 120 string matching algorithms have been proposed. In this note we present a comprehensive list of (almost) all string matching algorithms. The list is

show abstract

“…М. Ахмед с коллегами разра-ботал алгоритм поиска образа в строке, который в отличие от других алгоритмов сравнения строк никогда не выполняет более n сравнений символов при обработке текста длины n [3]. Т.…”

Section: Introductionunclassified