Učitavanje...
An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.
There are a few algorithms designed to solve the problem of the optimal alignment of one sequence, the pattern, of length m, with another, longer sequence the text, of length n. These algorithms allow mismatches, deletions and insertions. Algorithms to date run in O(mn) time. Let us define an intege...
Spremljeno u:
| Glavni autori: | , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
1986
|
| Online pristup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC339353/ https://ncbi.nlm.nih.gov/pubmed/3753770 |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|