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...
| Published in: | SHS Web of Conferences Vol. 144; pp. 1 - 7 |
|---|---|
| Main Author: | |
| Format: | Article |
| Published: |
EDP Sciences
8/26/022
|
| Online Access: | View this record in EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=158850594&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 158850594 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 24165182 FT5R jtl: SHS Web of Conferences issn: 24165182 maglogo: N pubinfo: dt: 8/26/022 vid: 144 pid: 76090 pub: EDP Sciences artinfo: ui: 158850594 10.1051/shsconf/202214403018 ppf: 1 ppct: 6 formats: tig: atl: Review on String-Matching Algorithm. aug: au: Zhang, Zhaoyang affil: University of Electronic Science and Technology of China sug: ab: 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. pubtype: Conference Proceedings doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2022 holdings: @attributes: islocal: N |
|---|