Email updates

Keep up to date with the latest news and content from BMC Bioinformatics and BioMed Central.

This article is part of the supplement: 22nd International Conference on Genome Informatics: Bioinformatics

Open Access Proceedings

Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies

Masaaki Shimizu1, Hiroshi Nagamochi1* and Tatsuya Akutsu2

Author Affiliations

1 Graduate School of Informatics, Kyoto University, Yoshida, Kyoto 606-8501, Japan

2 Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto 611-0011, Japan

For all author emails, please log on.

BMC Bioinformatics 2011, 12(Suppl 14):S3  doi:10.1186/1471-2105-12-S14-S3

Published: 14 December 2011

Additional files

Additional file 1:

Comparison of multiplicity-cut Comparison of SimEnum including multiplicity-cut and SimEnum not including multiplicity-cut for the problem ETULF. Note: (1) “add multiplicity-cut” is the algorithm SimEnum including multiplicity-cut; and (2) “no multiplicity-cut” is the algorithm SimEnum not including multiplicity-cut.

Format: PDF Size: 10KB Download file

This file can be viewed with: Adobe Acrobat Reader

Open Data