ロード中...
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 |
| 主題: | |
| オンライン･アクセス: | http://journal.frontiersin.org/article/10.3389/fgene.2017.00104/full |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|