problem-LastBossOrigin

  问题：找出一个短字符串在一个长字符串中的精确匹配。 要求：基于BWT压缩和FM索引技术的序列匹配，用Burrows-Wheeler transform算法解决该问题。(Problem: find the exact match of a short string in a long string. Requirements: BWT-based compression and indexing techniques sequence matching FM, with the Burrows-Wheeler transform algorithm to solve the problem)

problem-LastBossOrigin
......................\problem-LastBoss
......................\................\FinalProject.cpp,11477,2013-01-08
......................\................\main.dsp,3377,2013-01-08
......................\................\main.dsw,516,2013-01-08
......................\................\main.ncb,50176,2013-01-14
......................\................\main.opt,48640,2013-01-14
......................\................\main.plg,1162,2013-01-14
......................\................\out.txt,324,2013-01-08
......................\................\search_SRR00001.txt,202000,2013-01-04
......................\................\search_SRR163132.txt,202000,2013-01-04
......................\................\search_SRR311115.txt,202000,2013-01-04
......................\................\temp.txt,408,2013-01-08
......................\................\test.txt,895,2013-01-08
......................\................\后缀数组——处理字符串的有力工具.pdf,333469,2013-01-07
......................\................\基于BWT压缩和FM索引技术的序列匹配实验报告林川杰2010202594.docx,686788,2013-01-14
......................\................\大作业 2012-12-10.ppt,103424,2012-12-13