Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Wpa Willem Ligtenberg"'
Publikováno v:
Journal of Bioinformatics and Computational Biology, 11(4):1350004, 1-17. World Scientific
Interface and visualization tools usually provide static representations of biological pathways, which can be a severe limitation: fixed pathway boundaries are used without consensus about the elements that should be included in a particular pathway;
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cad9f5253fa75f61be28a054f9273732
https://doi.org/10.1142/S0219720013500042
https://doi.org/10.1142/S0219720013500042
Publikováno v:
BMC Bioinformatics, 13(281). BioMed Central
BMC Bioinformatics
BMC Bioinformatics, Vol 13, Iss 1, p 281 (2012)
BMC Bioinformatics
BMC Bioinformatics, Vol 13, Iss 1, p 281 (2012)
Background Techniques for reconstruction of biological networks which are based on perturbation experiments often predict direct interactions between nodes that do not exist. Transitive reduction removes such relations if they can be explained by an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01087fdc85267ea6698bc79e605d9f12
https://research.tue.nl/nl/publications/6781ad05-a8b1-429e-9b2e-c718cf64dde2
https://research.tue.nl/nl/publications/6781ad05-a8b1-429e-9b2e-c718cf64dde2
Publikováno v:
DEXA Workshops
Database and Expert Systems Applications (Proceedings 20th International Workshop, DEXA'09, Linz, Austria, August 31-September 4, 2009), 213-217
STARTPAGE=213;ENDPAGE=217;TITLE=Database and Expert Systems Applications (Proceedings 20th International Workshop, DEXA'09, Linz, Austria, August 31-September 4, 2009)
Database and Expert Systems Applications (Proceedings 20th International Workshop, DEXA'09, Linz, Austria, August 31-September 4, 2009), 213-217
STARTPAGE=213;ENDPAGE=217;TITLE=Database and Expert Systems Applications (Proceedings 20th International Workshop, DEXA'09, Linz, Austria, August 31-September 4, 2009)
In this paper we employ a recent algorithm by Zantema et al. for detecting maximal frequent subgraphs (MFS) in collections of graphs corresponding tobiological networks from the KEGG database. Each graph of a particular collection corresponds to one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a2bff44fb6b77df81c68b7f917fb529
https://doi.org/10.1109/dexa.2009.66
https://doi.org/10.1109/dexa.2009.66