लोड हो रहा है...
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 |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|