skip to main content
Show Results with: Show Results with:

Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets

Zantema, H. et al.

Communications in computer and information science.; Bioinformatics research and development; Vienna, Austria, 2008; Jul, 2008, 303-317 -- Berlin; Springer-Verlag; 2008 (pages 303-317) -- 2008

Check library holdings

  • Title:
    Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets
  • Author: Zantema, H.;
    Wagemans, S.;
    Bosnacki, D.;
    Elloumi, M.
  • Other Titles: Communications in computer and information science
  • Found In: Communications in computer and information science.; Bioinformatics research and development; Vienna, Austria, 2008; Jul, 2008, 303-317
  • Conference Title: Communications in computer and information science.
  • Subjects: Bioinformatics
  • Publication Details: Berlin; Springer-Verlag; 2008
  • Language: English
  • Place Name: Vienna, Austria
  • Description: Includes bibliographical references and index
  • Identifier: Journal ISSN: 1865-0929
    Conference ISBN: 9783540705987; 3540705988
  • Publication Date: 2008
  • Physical Description: Physical
  • Shelfmark(s): 3359.544000
  • UIN: ETOCCN069157024

Searching Remote Databases, Please Wait