Загрузка...
FACC: A Novel Finite Automaton Based on Cloud Computing for the Multiple Longest Common Subsequences Search
Searching for the multiple longest common subsequences (MLCS) has significant applications in the areas of bioinformatics, information processing, and data mining, and so forth, Although a few parallel MLCS algorithms have been proposed, the efficiency and effectiveness of the algorithms are not sat...
Сохранить в:
| Главные авторы: | , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Hindawi Limited
2012-01-01
|
| Серии: | Mathematical Problems in Engineering |
| Online-ссылка: | http://dx.doi.org/10.1155/2012/310328 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|