This site is a prelude to the internationally supported BioCatalogue system that will collect, store, validate, and make available web-services in the biosciences. This registry is mainly meant for the EU projects EMBRACE, BioSapiens and ENFIN, but other users are welcome too. As a potential web service user, you can search or browse the registry for services that match your needs. Furthermore, each entry includes live test data, showing the current and historical status of the service. Each entry can also include example client software to help you include them in your own programs or workflows. As a service provider, the registry helps you build high quality services that conform to industry standards, and gives you a means of advertising your tools to the user community as well as a platform for testing your service. Your service remains your property and published by you - this registry merely advertises its existence and its status.
This system will in due time merge seamlessly into the BioCatalogue, and if you use this registry, you will not have to register your service again with the BioCatalogue.
ConsensusPathDB is a database that integrates pathway and interaction resources like Reactome, HumanCyc, IntAct, Pathway Interaction Database and others. ConsensusPathDB contains biochemical reactions, protein interactions, genetic interactions, gene regulatory interactions and drug-target interactions involving different types of physical entities like genes, RNA, proteins, complexes, metabolites. The provided web services offer pathway analysis functionality for user-specified lists of genes or metabolites. For detailed information, please read:
This service converts a network in gml, gdl, KGML or tab-delimited format into a network in gml, gdl, pajek, tab-delimited, dot or VisML format.
The KEGG network provider constructs organism-specific metabolic networks from the KEGG PATHWAY KGML files.
The pathway extraction service connects groups of seed nodes in a weighted graph.
The pathfinding service enumerates the k shortest paths between a set of source and target nodes in a weighted graph. It is a wrapper of REA developped by Jimenez and Marzal.