Loading...
Efficient algorithms for folding and comparing nucleic acid sequences.
Fast algorithms for analysing sequence data are presented. An algorithm for strict homologies finds all common subsequences of length greater than or equal to 6 in two given sequences. With it, nucleic acid pieces five thousand nucleotides long can be compared in five seconds on CDC 6600. Secondary...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
1982
|
| Online Access: | https://ncbi.nlm.nih.gov/pmc/articles/PMC326126/ https://ncbi.nlm.nih.gov/pubmed/6174935 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|