Chargement en cours...
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...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
Frontiers Media S.A.
2017-08-01
|
| Collection: | Frontiers in Genetics |
| Sujets: | |
| Accès en ligne: | http://journal.frontiersin.org/article/10.3389/fgene.2017.00104/full |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|