Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies
<p>Abstract</p> <p>Background</p> <p>Enumeration of chemical graphs satisfying given constraints is one of the fundamental problems in chemoinformatics and bioinformatics since it leads to a variety of useful applications including structure determination of novel chemi...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2011-12-01
|
| Series: | BMC Bioinformatics |