A carregar...
Fast computation of a string duplication history under no-breakpoint-reuse
In this paper, we provide an O(n log(2) n log log n log* n) algorithm to compute a duplication history of a string under no-breakpoint-reuse condition. The motivation of this problem stems from computational biology, in particular, from analysis of complex gene clusters. The problem is also related...
Na minha lista:
| Main Authors: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
The Royal Society Publishing
2014
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3996574/ https://ncbi.nlm.nih.gov/pubmed/24751867 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1098/rsta.2013.0133 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|