Efficient Pattern Matching on Binary Strings

Details Efficient Pattern Matching on Binary Strings Efficient Pattern Matching on Binary Strings

2008-10-14

arxiv.org/abs/0810.2390v2

Computer Science

Data Structures and Algorithms

12 pages

Scientific paper

The binary string matching problem consists in finding all the occurrences of a pattern in a text where both strings are built on a binary alphabet. This is an interesting problem in computer science, since binary data are omnipresent in telecom and computer network applications. Moreover the problem finds applications also in the field of image processing and in pattern matching on compressed texts. Recently it has been shown that adaptations of classical exact string matching algorithms are not very efficient on binary data. In this paper we present two efficient algorithms for the problem adapted to completely avoid any reference to bits allowing to process pattern and text byte by byte. Experimental results show that the new algorithms outperform existing solutions in most cases.

Affiliated with

Also associated with

No associations

Rating

Efficient Pattern Matching on Binary Strings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Pattern Matching on Binary Strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Pattern Matching on Binary Strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-591033