Novel data packing algorithm for improved string matching
Mark R. Titchener · IEE Proceedings E Computers and Digital Techniques · 1986
A novel method for packing sequential data offers improvements in the efficiency of pattern-matching algorithms. The technique utilises the stochastic synchronisation capability of the augmented T-codes, and the typographical packing procedure provided by the binary-depletion T-codes. The two homomorphic coding systems used here and previously presented are introduced briefly again in an informal development of the packing scheme. In the proposed scheme the problem of locating a pattern within a packed data sequence is seen to be analogous to that of determining synchronisation during the decoding of a corrupted message sequence. The systematic details for implementation of the scheme are discussed in terms of a practical application using sequences of naturally occurring DNA code.