Hybrid string matching algorithm with a pivot

Pattern matching is important in text processing, molecular biology, operating systems and web search engines. Many algorithms have been developed to search for a specific pattern in a text, but the need for an efficient algorithm is an outstanding issue. In this paper, we present a simple and pract...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of information science Ročník 41; číslo 1; s. 82 - 88
Hlavní autor: Al-Ssulami, Abdulrakeeb M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: London, England SAGE Publications 01.02.2015
Bowker-Saur Ltd
Témata:
Algorithms
Biology
Genomes
Genomics
Human
Matching
Molecular biology
Natural language
Operating systems
Pattern recognition
Pivots
Proteins
Search engines
String matching
Studies
Text processing
Texts
Word processing
online string searching
Design of algorithms
experimental algorithms
ISSN:0165-5515, 1741-6485
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Pattern matching is important in text processing, molecular biology, operating systems and web search engines. Many algorithms have been developed to search for a specific pattern in a text, but the need for an efficient algorithm is an outstanding issue. In this paper, we present a simple and practical string matching algorithm. The proposed algorithm is a hybrid that combines our modification of Horspool’s algorithm with two observations on string matching. The algorithm scans the text from left to right and matches the pattern from right to left. Experimental results on natural language texts, genomes and human proteins demonstrate that the new algorithm is competitive with practical algorithms.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0165-5515
1741-6485
DOI:10.1177/0165551514555668