Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (17)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fukuda, K.-i.
Right arrow Articles by Takagi, T.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Fukuda, K.-i.
Right arrow Articles by Takagi, T.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 17 no. 9 2001
Pages 829-837
© 2001 Oxford University Press

Knowledge representation of signal transduction pathways

Ken-ichiro Fukuda 1,2 and Toshihisa Takagi 1

1 Human Genome Center, Institute of Medical Science, University of Tokyo, 4-6-1 Shirokanedai, Minato-ku, Tokyo 108-8639, Japan

Received on December 11, 2000 ; revised on March 7, 2001 ; accepted on April 17, 2001

Motivations: Signal transduction is the common term used to define a diverse topic that encompasses a large body of knowledge about the biochemical mechanisms. Since most of the knowledge of signal transduction resides in scientific articles and is represented by texts in natural language or by diagrams, there is the need of a knowledge representation model for signal transduction pathways that can be as readily processed by a computer as it is easily understood by humans.

Results: A signal transduction pathway representation model is presented. It is based on a compound graph structure and is designed to handle the diversity and hierarchical structure of pathways. A prototype knowledge base was implemented on a deductive database and a number of biological queries are demonstrated on it.

Contact: fukuda-cbrc{at}aist.go.jp; ichiro{at}ims.u-tokyo.ac.jp

2 Present address: Computational Biology Research Center (CBRC), NationalInstitute of Advanced Industrial Science and Technology (AIST) 2-41-6 Aomi, Koutou-ku, Tokyo 135-0064, Japan.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Nucleic Acids ResHome page
S. Brohee, K. Faust, G. Lima-Mendez, O. Sand, R. Janky, G. Vanderstocken, Y. Deville, and J. van Helden
NeAT: a toolbox for the analysis of biological networks, clusters, classes and pathways
Nucleic Acids Res., July 1, 2008; 36(suppl_2): W444 - W451.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
Z. Hu, D. M. Ng, T. Yamada, C. Chen, S. Kawashima, J. Mellor, B. Linghu, M. Kanehisa, J. M. Stuart, and C. DeLisi
VisANT 3.0: new modules for pathway visualization, editing, prediction and construction
Nucleic Acids Res., July 13, 2007; 35(suppl_2): W625 - W632.
[Abstract] [Full Text] [PDF]

Home page
 Mol. Cell. ProteomicsHome page
E. Paek, J. Park, and K.-J. Lee
Multi-layered Representation for Cell Signaling Pathways
Mol. Cell. Proteomics, October 1, 2004; 3(10): 1009 - 1022.
[Abstract] [Full Text] [PDF]

Home page
 Genome ResHome page
Y. Zheng, J. D. Szustakowski, L. Fortnow, R. J. Roberts, and S. Kasif
Computational Identification of Operons in Microbial Genomes
Genome Res., August 1, 2002; 12(8): 1221 - 1230.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.