Burrows Wheeler Transform
Mostrando 1-2 de 2 artigos, teses e dissertações.
-
1. A TRANSFORMADA DE BURROWS-WHEELER E SUA APLICAÇÃO À COMPRESSÃO / THE BURROWS-WHEELER TRANSFORM AND ITS APPLICATIONS TO COMPRESSION
The Burrows-Wheeler Transform, based on sorting of contexts, transforms a sequence of characters into a new sequence easier to compress by an algorithm that exploits long sequences of repeted characters. Combined with the coding provided by the MoveToFront Algorithm and followed by a codification for the generated integers, they propose a new family of compr
Publicado em: 2003
-
2. Annotating Large Genomes With Exact Word Matches
We have developed a tool for rapidly determining the number of exact matches of any word within large, internally repetitive genomes or sets of genomes. Thus we can readily annotate any sequence, including the entire human genome, with the counts of its constituent words. We create a Burrows-Wheeler transform of the genome, which together with auxiliary data
Cold Spring Harbor Laboratory Press.