A carregar...

An efficient string matching algorithm with k differences for nucleotide and amino acid sequences.

There are a few algorithms designed to solve the problem of the optimal alignment of one sequence, the pattern, of length m, with another, longer sequence the text, of length n. These algorithms allow mismatches, deletions and insertions. Algorithms to date run in O(mn) time. Let us define an intege...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Main Authors: Landau, G M, Vishkin, U, Nussinov, R
Formato: Artigo
Idioma:Inglês
Publicado em: 1986
Acesso em linha:https://ncbi.nlm.nih.gov/pmc/articles/PMC339353/
https://ncbi.nlm.nih.gov/pubmed/3753770
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!