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...
Uloženo v:
| Vydáno v: | Nucleic Acids Res |
|---|---|
| Hlavní autoři: | , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Oxford University Press
1982
|
| On-line přístup: | https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC326126/ https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/6174935/ https://ncbi.nlm.nih.govhttps://doi.org/10.1093/nar/10.1.197 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|