Carregant...
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem
The multiple longest common subsequence (MLCS) problem, related to the identification of sequence similarity, is an important problem in many fields. As an NP-hard problem, its exact algorithms have difficulty in handling large-scale data and time- and space-efficient algorithms are required in real...
Guardat en:
| Publicat a: | IEEE Trans Knowl Data Eng |
|---|---|
| Autors principals: | , , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
2014
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4231498/ https://ncbi.nlm.nih.gov/pubmed/25400485 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1109/TKDE.2014.2304464 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|