Very Fast Pattern Matching for Highly Repetitive Text
This paper describes two searching methods for locating longest string matches in source texts of low entropy. A modi cation of the Boyer-Moore scanning algorithm and a statistical method, which searches for less likely symbols, are presented. Both algorithms have been implemented as part of the searching strategy for an LZ77 type encoder. Experimental results are included.
SubjectsFields of Research::280000 Information, Computing and Communication Sciences::280300 Computer Software::280303 Programming languages
- Engineering: Reports