A carregar...
Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem
The all-pairs suffix-prefix matching problem is a basic problem in string processing. It has an application in the de novo genome assembly task, which is one of the major bioinformatics problems. Due to the large size of the input data, it is crucial to use fast and space efficient solutions. In thi...
Na minha lista:
| Main Authors: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Hindawi Publishing Corporation
2014
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4009283/ https://ncbi.nlm.nih.gov/pubmed/24834435 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1155/2014/745298 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|