Cargando...
Relative Suffix Trees
Suffix trees are one of the most versatile data structures in stringology, with many applications in bioinformatics. Their main drawback is their size, which can be tens of times larger than the input sequence. Much effort has been put into reducing the space usage, leading ultimately to compressed...
Gardado en:
| Publicado en: | Comput J |
|---|---|
| Main Authors: | , , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Oxford University Press
2018
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5956352/ https://ncbi.nlm.nih.gov/pubmed/29795706 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1093/comjnl/bxx108 |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|