如果仅仅是得到序列比对的得分最大值和其对应的坐标其空间复杂度可以是线性的。但是如果要得到具体的比对结果即要得到在哪里是匹配的哪里是插入哪里是删除这就需要在第一阶段时计算回溯矩阵并保存整个回溯矩阵因此此时空间复杂度为Omn帮我翻译上面那一段话用于写在论文中

If only the maximum score of sequence alignment and its corresponding coordinates are required, the space complexity can be linear. However, if specific alignment results are needed, including matches, insertions, and deletions, the full traceback matrix needs to be computed and stored during the first stage. Therefore, the space complexity in this case is O(mn).

Please note that the translation may vary depending on the context and the specific terminology used in your paper.