Maximum common subgraph: some upper bound and lower bound results
<p>Abstract</p> <p>Background</p> <p>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...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Artikel |
| Språk: | English |
| Publicerad: |
BMC
2006-12-01
|
| Serie: | BMC Bioinformatics |