Cargando...
The diagonal-traverse homology search algorithm for locating similarities between two sequences.
We present a fast computer algorithm for finding homology between two DNA sequences. It generates a two-dimensional display in which a diagonal string of dots represents a stretch of homology between the two sequences. Our algorithm performs the search very rapidly, and has no internal data storage...
Gardado en:
| Main Authors: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
1984
|
| Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC321090/ https://ncbi.nlm.nih.gov/pubmed/6320108 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|