Finding frequent subgraphs in biological networks via maximal item sets

H. Zantema, S. Wagemans, D. Bosnacki

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)
3 Downloads (Pure)


We describe an improvement of an algorithm for detecting frequently occurring patterns and modules in biological networks. The improvement is based on the observation that the problem of finding frequent network parts can be reduced to the problem of finding maximal frequent item sets (MFI). The MFI problem is a classical problem in the data mining community and there exist numerous efficient tools for it, most of them publicly available. We apply MFI tools to find frequent subgraphs in metabolic pathways from the KEGG database. Our experimental results show that, compared to the existing specialized tools for frequent subgraphs detection, the MFI tools coupled with an adequate postprocessing are much more efficient with regard to the running time and the size of the frequent graphs.
Original languageEnglish
Title of host publicationBioinformatics Research and Development (2nd International Conference, BIRD'08, Vienna, Austria, July 7-9, 2008, Proceedings)
EditorsM. Elloumi, J. Küng, M. Linial, R. Murphy, K. Schneider, C. Toma
Place of PublicationBerlin
ISBN (Print)978-3-540-70598-7
Publication statusPublished - 2008

Publication series

NameCommunications in Computer and Information Science
ISSN (Print)1865-0929


Dive into the research topics of 'Finding frequent subgraphs in biological networks via maximal item sets'. Together they form a unique fingerprint.

Cite this