Abstract

String matching became important application nowadays, the increasing of database such as websites, document, DNA, etc., leads to the urgent needs for string matching; string matching has many applications such as DNA, protein matching, internet search engine, all these types of application of string matching, beside the huge amount of database lead to increase the need to fast and efficient string matching algorithms. This study is about comparing among most well-known string matching algorithms; it focuses on four types of string matching algorithms, each one of them working in a different way. The four are tested with four types of data; ASCII (256 character), English alphabet (26 characters), DNA (20 character), and protein (4 character), with different pattern length (100, 50, 20, 10, 5) results shown based on number of comparisons and time.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.