A carregar...
A new algorithm for “the LCS problem” with application in compressing genome resequencing data
BACKGROUND: The longest common subsequence (LCS) problem is a classical problem in computer science, and forms the basis of the current best-performing reference-based compression schemes for genome resequencing data. METHODS: First, we present a new algorithm for the LCS problem. Using the generali...
Na minha lista:
| Publicado no: | BMC Genomics |
|---|---|
| Main Authors: | , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
BioMed Central
2016
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5001248/ https://ncbi.nlm.nih.gov/pubmed/27556803 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s12864-016-2793-0 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|