A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays

AUTOR(ES)

Khan, Zia

FONTE

Oxford University Press

RESUMO

Motivation: High-throughput sequencing technologies place ever increasing demands on existing algorithms for sequence analysis. Algorithms for computing maximal exact matches (MEMs) between sequences appear in two contexts where high-throughput sequencing will vastly increase the volume of sequence data: (i) seeding alignments of high-throughput reads for genome assembly and (ii) designating anchor points for genome–genome comparisons.

Documentos Relacionados

• Annotating Large Genomes With Exact Word Matches
• Synthesis of Sparse Arrays Based On CIGA (Convex Improved Genetic Algorithm)
• An algorithm and program for finding sequence specific oligo-nucleotide probes for species identification
• Optimization of Planar Antenna Arrays Using the Firefly Algorithm
• A dynamic programming algorithm for finding alternative RNA secondary structures.