A carregar...
A Simple Algorithm for Maximum Clique and Matching Protein Structures
The maximum common subgraph (MCS) problem has become increasingly important in matching protein structures of two proteins. Two proteins represented as graphs by simple contact map and product of these graphs was input to the proposed algorithm. A maximum clique in the product graph, found by the pr...
Na minha lista:
| Publicado no: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Main Authors: | , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
International Journal of Combinatorial Optimization Problems and Informatics
2010
|
| Assuntos: | |
| Acesso em linha: | https://www.redalyc.org/articulo.oa?id=265220654002 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|