Algorithms for Comparing Run-Length Encoded Strings without Decoding
博士 === 國立臺灣大學 === 資訊工程學研究所 === 99 === A recent trend in stringology combines the two concepts of pattern matching and data compression, creating the so-called compressed pattern matching problem. The ultimate goal in this line of investigation is to design algorithms that can cope with encoded strin...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/98024825139801717013 |