问题：找出一个短字符串在一个长字符串中的精确匹配。 要求：基于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