Chargement en cours...
A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays
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...
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
Oxford University Press
2009
|
| Sujets: | |
| Accès en ligne: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2732316/ https://ncbi.nlm.nih.gov/pubmed/19389736 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1093/bioinformatics/btp275 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|