Maximum common subgraph: some upper bound and lower bound results

BACKGROUND: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this process into a problem of finding a maximum common subgraph between graphical representations of these structures. Among t...

Descripción completa

Detalles Bibliográficos
Autores principales: Huang, Xiuzhen, Lai, Jing, Jennings, Steven F
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2006
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1780128/
https://www.ncbi.nlm.nih.gov/pubmed/17217524
http://dx.doi.org/10.1186/1471-2105-7-S4-S6

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1780128/
https://www.ncbi.nlm.nih.gov/pubmed/17217524
http://dx.doi.org/10.1186/1471-2105-7-S4-S6

Ejemplares similares