A carregar...
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...
Na minha lista:
| Publicado no: | IEEE Trans Knowl Data Eng |
|---|---|
| Main Authors: | , , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2014
|
| Assuntos: | |
| Acesso em linha: | 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 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|