Review on String-Matching Algorithm

String-matching algorithm is one of the most researched algorithms in computer science which has become an important factor in many technologies. This field aims at utilizing the least time and resources to find desired sequence of character in complex data content. The most classical and famous str...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SHS web of conferences Ročník 144; s. 3018
Hlavní autor: Zhang, Zhaoyang
Médium: Journal Article Konferenční příspěvek
Jazyk:angličtina
Vydáno: Les Ulis EDP Sciences 2022
Témata:
Algorithms
Computer science
Heuristic
Matching
Prefixes
Research applications
Science and technology
Suffixes
ISSN:2261-2424, 2416-5182, 2261-2424
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í:String-matching algorithm is one of the most researched algorithms in computer science which has become an important factor in many technologies. This field aims at utilizing the least time and resources to find desired sequence of character in complex data content. The most classical and famous string-search algorithms are Knuth-Morris-Pratt (KMP) algorithm and Boyer-Moore (DM) algorithm. These two algorithms provide efficient heuristic jump rules by prefix or suffix. Bitap algorithm was the first to introduce bit-parallelism into string-matching field. Backward Non-Deterministic DAWG Matching (BNDM) algorithm is a modern practical algorithm that is an outstanding combination of theoretical research and practical application. Those meaningful algorithms play a guiding role in future research in string-search algorithm to improve the average performance of the algorithm and reduce resource consumption.
Bibliografie:ObjectType-Conference Proceeding-1
SourceType-Conference Papers & Proceedings-1
content type line 21
ISSN:2261-2424
2416-5182
2261-2424
DOI:10.1051/shsconf/202214403018