Cargando...
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...
Gardado en:
| Main Authors: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Frontiers Media S.A.
2017-08-01
|
| Series: | Frontiers in Genetics |
| Assuntos: | |
| Acceso en liña: | http://journal.frontiersin.org/article/10.3389/fgene.2017.00104/full |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|