載入...
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...
Na minha lista:
| Main Authors: | , |
|---|---|
| 格式: | Artigo |
| 語言: | Inglês |
| 出版: |
Frontiers Media S.A.
2017-08-01
|
| 叢編: | Frontiers in Genetics |
| 主題: | |
| 在線閱讀: | http://journal.frontiersin.org/article/10.3389/fgene.2017.00104/full |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|