Učitavanje...
Inexact Local Alignment Search over Suffix Arrays
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may contain insertions and deletions. We present a generalized heuristic for finding such seeds efficiently and prove that the he...
Spremljeno u:
| Glavni autori: | , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
2009
|
| Teme: | |
| Online pristup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3029072/ https://ncbi.nlm.nih.gov/pubmed/21278916 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1109/BIBM.2009.25 |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|