A carregar...

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

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Main Authors: Dumas, J P, Ninio, J
Formato: Artigo
Idioma:Inglês
Publicado em: 1982
Acesso em linha:https://ncbi.nlm.nih.gov/pmc/articles/PMC326126/
https://ncbi.nlm.nih.gov/pubmed/6174935
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!