On the Construction of the Burrows-Wheeler Transform and the Maximal Repeating Group Finding
碩士 === 國立清華大學 === 資訊工程學系 === 104 === In this thesis, we are interested in the Burrows-Wheeler Transform (BWT for short) for exact string matching. The problem of BWT is that it is very time-consuming to construct BWT. We have developed a method which is based upon the KSS Method to construct BWT. Ou...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/73657630055093036133 |