Загрузка...
A fast parallel algorithm for finding the longest common sequence of multiple biosequences
BACKGROUND: Searching for the longest common sequence (LCS) of multiple biosequences is one of the most fundamental tasks in bioinformatics. In this paper, we present a parallel algorithm named FAST_LCS to speedup the computation for finding LCS. RESULTS: A fast parallel algorithm for LCS is present...
Сохранить в:
| Главные авторы: | , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
BioMed Central
2006
|
| Предметы: | |
| Online-ссылка: | https://ncbi.nlm.nih.gov/pmc/articles/PMC1780122/ https://ncbi.nlm.nih.gov/pubmed/17217522 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1471-2105-7-S4-S4 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|