Very Fast Pattern Matching for Highly Repetitive Text
Type of content
Reports
UC permalink
Publisher's DOI/URI
Thesis discipline
Degree name
Publisher
Department of Computer Science, University of Canterbury
University of Canterbury. Computer Science and Software Engineering
University of Canterbury. Computer Science and Software Engineering
Journal Title
Journal ISSN
Volume Title
Language
Date
1993
Authors
Kulp, D.
Abstract
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.
Description
TR-COSC 01/93
Citation
Kulp, D. (1993) Very Fast Pattern Matching for Highly Repetitive Text..