Lanean...

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...

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile Nagusiak: Dumas, J P, Ninio, J
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: 1982
Sarrera elektronikoa:https://ncbi.nlm.nih.gov/pmc/articles/PMC326126/
https://ncbi.nlm.nih.gov/pubmed/6174935
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!