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...
সংরক্ষণ করুন:
| প্রকাশিত: | Nucleic Acids Res |
|---|---|
| প্রধান লেখক: | , |
| বিন্যাস: | Artigo |
| ভাষা: | Inglês |
| প্রকাশিত: |
Oxford University Press
1982
|
| অনলাইন ব্যবহার করুন: | 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 |
| ট্যাগগুলো: |
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|