Term info
Subsets
operations, edam
Created in
1.1
comment
Many sequence alignment tasks involving many or very large sequences rely on a precomputed index of the sequence to accelerate the alignment. The Burrows-Wheeler Transform (BWT) is a permutation of the genome based on a suffix array algorithm. A suffix array consists of the lexicographically sorted list of suffixes of a genome.