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...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Main Authors: Huang, Xiuzhen, Lai, Jing, Jennings, Steven F
Format: Artigo
Jezik:Inglês
Izdano: BioMed Central 2006
Teme:
Research
Online dostop:https://ncbi.nlm.nih.gov/pmc/articles/PMC1780128/
https://ncbi.nlm.nih.gov/pubmed/17217524
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1471-2105-7-S4-S6
Oznake: Označite
Brez oznak, prvi označite!

Podobne knjige/članki