Cargando…
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...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7350648/ https://www.ncbi.nlm.nih.gov/pubmed/32646365 http://dx.doi.org/10.1186/s12859-020-03595-2 |