A carregar...
Matching Sequences under Deletion/Insertion Constraints
Given two finite sequences, we wish to find the longest common subsequences satisfying certain deletion/insertion constraints. Consider two successive terms in the desired subsequence. The distance between their positions must be the same in the two original sequences for all but a limited number of...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
1972
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC427531/ https://ncbi.nlm.nih.gov/pubmed/4500555 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|