Description: 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
To Search:
File list (Check if you may need any files):
problem-LastBossOrigin
......................\problem-LastBoss
......................\................\FinalProject.cpp
......................\................\main.dsp
......................\................\main.dsw
......................\................\main.ncb
......................\................\main.opt
......................\................\main.plg
......................\................\out.txt
......................\................\search_SRR00001.txt
......................\................\search_SRR163132.txt
......................\................\search_SRR311115.txt
......................\................\temp.txt
......................\................\test.txt
......................\................\后缀数组——处理字符串的有力工具.pdf
......................\................\基于BWT压缩和FM索引技术的序列匹配实验报告林川杰2010202594.docx
......................\................\大作业 2012-12-10.ppt
Download