Annotating Large Genomes With Exact Word Matches
AUTOR(ES)
Healy, John
FONTE
Cold Spring Harbor Laboratory Press
RESUMO
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 structures facilitating counting, can reside in about one gigabyte of RAM. Our original interest was motivated by oligonucleotide probe design, and we describe a general protocol for defining unique hybridization probes. But our method also has applications for the analysis of genome structure and assembly. We demonstrate the identification of chromosome-specific repeats, and outline a general procedure for finding undiscovered repeats. We also illustrate the changing contents of the human genome assemblies by comparing the annotations built from different genome freezes.
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=403711Documentos Relacionados
- A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays
- Intraspecies sequence comparisons for annotating genomes
- Rfam: annotating non-coding RNAs in complete genomes
- Distributional regimes for the number of k-word matches between two random sequences
- Contract enforcement and incentive compatibility in large economies with differential information: the role of exact feasibility
