期刊文献+

基于TGG的SBML与其他生物建模语言间的自动转换研究 被引量:1

TGG Based Automatic Transformation Between SBML and Other Biological Modeling Languages
下载PDF
导出
摘要 基于XSLT技术的SBML与其他生物建模语言之间的转换方法存在无法保证转换结果的确定性、语法正确性及不能满足模型转换的工业化需求等缺陷.针对以上问题,提出了利用图文法定义SBML Schema及其他生物建模语言,并且利用Triple Graph Grammar构造SBML与其他建模语言之间的转换方法.在此基础上,提出了一种基于单路径尝试条件的转换算法,该算法具有多项式时间复杂性,能够保证转换目标对象的确定性与语法正确性,给出了相关证明,并且讨论了该条件在生物模型转换中的适用性.与传统方法相比,该方法利用可视化方法实现转换,简化了定义过程;无需动态检查转换过程,只要转化规则正确即可保证转换结果正确;同时支持扩增传播以及模型间双向转换.最后,通过Petri网与SBML之间的转换例子证实了该算法的正确性与有效性. XSLT based transformation,between SBML and other biological modeling languages,cannot describe comprehensive context-sensitive semantic correspondences among the inner elements of biological modeling objects;cannot guarantee the determinacy and syntactic correctness of transformation results;and also cannot meet industrial transformation requirements.Toward these problems,a triple graph grammar(TGG) based transformation method is presented,which utilizes graph grammars to define SBML schema and other biological modeling languages,and utilizes TGG to construct transformation between them.On this basis,a transformation algorithm is presented,which has polynomial time complexity and can guarantee determinacy and syntactic correctness.Compared with the traditional transformation between SBML and other biological modeling languages,the method in this paper has the following characteristics:1) It utilizes context-sensitive grammar and has strong description capability;2) It imposes graph-based approach to simplify transformation definition process;3) It only needs static analysis of transformation rules at the design time without exploring dynamic analysis,because validation must be achieved if transformation rules satisfy some constraints;4) It only requires to change direction of transformation rules to implement bi-directional transformation,without modifying any element;and 5) It supports incremental change propagation,since it preserves the correspondence information between source and target objects.Finally,correctness and effectiveness of this method are verified through an example of transformation between Petri net and SBML.
出处 《计算机研究与发展》 EI CSCD 北大核心 2011年第5期885-896,共12页 Journal of Computer Research and Development
基金 国家"八六三"高技术研究发展计划基金项目(2006AA02Z344) 国家自然科学基金项目(60671013)
关键词 SBML 模型转换 TGG 图文法 XML SBML model transformation TGG graph grammar XML
  • 相关文献

参考文献38

  • 1Kitano H. Systems biology: A brief overview [J]. Science, 2002, 295 (5560): 1662-1664.
  • 2Nagasaki M. CellIllustrator: A platform for biopathway modeling and simulation[EB/OL]. 2002 [ 2008-11- 10]. http ://genomicobject. net/member3/index, html.
  • 3Takahashi K, Kazu K, Hu B, et al. A multi-algorithm, multi-timescale method for cell simulation [J]. Bioinformatics, 2004, 20 (4): 538-546.
  • 4Sauro H, Hucka M, Finney A, et al. Next generation simulation tools: The systems biology workbench and BioSPICE integration[J]. OMICS: Journal of Integrative Biology, 2003, 7 (4): 355-372.
  • 5Hedley W, Nelson M, Nielse P, et al. A short introduction to CellML [J]. Philosophical Trans of the Royal Society, 2001, 359 (1783): 1073-1089.
  • 6Hucka M, Finney A, Sauro H M, et al. The system biology markup language ( SBML ) : A medium fo representation anct exchange of biochemical network model [J]. Bioinformatics, 2003, 19 (4): 524-531.
  • 7Brauner E. BioPax: Biological pathway exchange [EB/OL]. 2004[ 2008-11-10 ]. http ://www. biopax, org/release/biopax- level3, owl.
  • 8Nagasaki M, Doi A, Matsuno H, et al. Petri net based description and modeling of biological pathways [C] //Proc of the 1st Int Conf on Algebraic Biology. Tokyo: Universal Academy Press, 2005:19-31.
  • 9Dong Zhupeng, Dong Xiaoju, Xu Xian, et al. An implementation for mapping SBML to BioSPI [G] //LNCS 3614: Proc of Int Conf Fuzzy Systems and Knowledge Discovery (FSKD'05). Berlin: Springer, 2005:1128-1131.
  • 10Nakano M, Kitakaze H, Matsuno H, et al. XML pathway file conversion between genomie object net and SBML [C] // Proc of Genome Informaties 2002. Tokyo: Universal Academy Press, 2002: 457-458.

二级参考文献8

  • 1李虎,金茂忠,许福,张敏.程序设计语言的GLR优化分析[J].软件学报,2005,16(2):174-183. 被引量:2
  • 2马晓星,余萍,陶先平,吕建.一种面向服务的动态协同架构及其支撑平台[J].计算机学报,2005,28(4):467-477. 被引量:80
  • 3J R Levine, T Mason, D Brown. Lex & Yacc [M]. Third edition. Sebastopol, USA: O'Reilly & Associates Inc, 1995.
  • 4A V Aho, R Sethi, J D Ullman. Compilers: Principles, Techniques, and Tools [M]. Reading MA: Addison-Wesley, 1986.
  • 5R N Horspool. Incremental generation of LR parsers [J]. Computer Languages, 1990, 15(4) ; 205-233.
  • 6F Deremer, T Pennello. Efficient computation of LALR ( 1 ) look-ahead sets [J]. ACM TOPLAS, 1982, 4(4): 615-649.
  • 7C Donnelly, R Stallmen. The Bison Manual: Using the YACCCompatible Parser Generator for Bison Version 1.875 [M]. Boston, USA: GNU Press, 2004.
  • 8M Astudill. GOLD parsing system [OL]. http://www. devincook com/goldparser/index. htm. 2006.

共引文献14

同被引文献8

  • 1Kewei Tu, Jing Lu, HaiPing Zhu, et al. A Semantic Search Approach Matching with Negations and Inferences [ J ]. Conceptual Stuetures for Knowledge creation and Communication, Sept. 03,2003,2746.
  • 2Rudolf Wille. Conceptual Graphs and Formal Concept Analysis[ M]. American : Springer Berlin Heidelberg, 1997.
  • 3Walling R Cyre. Executing Conceptual Graphs[ J]. The Bradey De- partment of Electrical and Computer Engineering,2010.
  • 4Ying Tang Dai. Research on the Key Techniques of Semantic Net- works based Kowledge Collaboration[ D]. FuDan Universlty,2009.
  • 5林鹃.基于图变换的用例驱动角色访问控制建模及分析[D].中南大学,2009.
  • 6Fulvio D' Antonio. Introduction to Graph Grammars[ R]. Theoretical Computer Science,2012,243:78 - 82.
  • 7Tassa, Tamir. Finding all maximally - matchable edges in a bipartite graph[ J]. Theoretical Computer Science, 2012,423:50 - 58.
  • 8麦范金,史慧.面向对象语义网络的知识表示[J].微计算机信息,2010,26(27):159-160. 被引量:4

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部