A carregar...
Efficient implied alignment
BACKGROUND: Given a binary tree [Formula: see text] of n leaves, each leaf labeled by a string of length at most k, and a binary string alignment function ⊗, an implied alignment can be generated to describe the alignment of a dynamic homology for [Formula: see text] . This is done by first decorati...
Na minha lista:
| Publicado no: | BMC Bioinformatics |
|---|---|
| Main Authors: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
BioMed Central
2020
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7350648/ https://ncbi.nlm.nih.gov/pubmed/32646365 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s12859-020-03595-2 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|