用于探索 Burrows-Wheeler 变换字母表排序的可视化工具
A visualization tool to explore alphabet orderings for the Burrows-Wheeler Transform
AI总结：
针对完整 BWT 矩阵占用 $O(n^2)$ 空间、难以检查的问题，本文提出 GUI 工具，支持前缀搜索、区段跳转和多种字母表排序探索，以辅助最小化 BWT 游程数。
摘要：
Burrows-Wheeler 变换（BWT）是一种高效的可逆文本变换算法，具有倾向于将相同字符聚集成一个游程，并支持对文本进行搜索的特性。该变换具有广泛用途，尤其用于无损压缩算法、索引编制，以及生物信息学中的序列比对任务。近期，人们关注于最小化某次变换的相同字符游程数量（$r$），并为与 BWT 构造相关的矩阵排序步骤寻找有用的字母表排序。这促使在开发算法时检查许多变换。然而，完整的 Burrows-Wheeler 矩阵需要 $O(n^2)$ 空间，因此对于较大的输入规模，很难显示和检查。本文提出了一个用于处理 BWT 的图形用户界面（GUI），其功能包括搜索矩阵行前缀、跳过最右列（即变换结果）中的区段，以及在探索字母表排序时显示 BWT，目标是最小化游程数量。
英文摘要：
The Burrows-Wheeler Transform (BWT) is an efficient invertible text transformation algorithm with the properties of tending to group identical characters together in a run, and enabling search of the text. This transformation has extensive uses particularly in lossless compression algorithms, indexing, and within bioinformatics for sequence alignment tasks. There has been recent interest in minimizing the number of identical character runs ($r$) for a transform and in finding useful alphabet orderings for the sorting step of the matrix associated with the BWT construction. This motivates the inspection of many transforms while developing algorithms. However, the full Burrows-Wheeler matrix is $O(n^2)$ space and therefore very difficult to display and inspect for large input sizes. In this paper we present a graphical user interface (GUI) for working with BWTs, which includes features for searching for matrix row prefixes, skipping over sections in the right-most column (the transform), and displaying BWTs while exploring alphabet orderings with the goal of minimizing the number of runs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
