Carregando...
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:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Frontiers Media S.A.
2017-08-01
|
| coleção: | Frontiers in Genetics |
| Assuntos: | |
| Acesso em linha: | http://journal.frontiersin.org/article/10.3389/fgene.2017.00104/full |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|