Загрузка...
A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem
Searching for the Multiple Longest Common Subsequences (MLCS) of multiple sequences is a classical NP-hard problem, which has been used in many applications. One of the most effective exact approaches for the MLCS problem is based on dominant point graph, which is a kind of directed acyclic graph (D...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Frontiers Media S.A.
2017-08-01
|
| Серии: | Frontiers in Genetics |
| Предметы: | |
| Online-ссылка: | http://journal.frontiersin.org/article/10.3389/fgene.2017.00104/full |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|