{"title":"利用最短路径进行代谢重建","authors":"Masanori Arita","doi":"10.1016/S0928-4869(00)00006-9","DOIUrl":null,"url":null,"abstract":"<div><p>This paper introduces a graph-oriented representation of metabolism, and shows how to apply the shortest path algorithm to reconstruct metabolic pathways. Our metabolic model is constructed from molecular structures of compounds and reaction formulas of enzymes, and its output is all the logically possible pathways consisting of input reactions. We also show how to integrate putative reactions in the model.</p></div>","PeriodicalId":101162,"journal":{"name":"Simulation Practice and Theory","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2000-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0928-4869(00)00006-9","citationCount":"66","resultStr":"{\"title\":\"Metabolic reconstruction using shortest paths\",\"authors\":\"Masanori Arita\",\"doi\":\"10.1016/S0928-4869(00)00006-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper introduces a graph-oriented representation of metabolism, and shows how to apply the shortest path algorithm to reconstruct metabolic pathways. Our metabolic model is constructed from molecular structures of compounds and reaction formulas of enzymes, and its output is all the logically possible pathways consisting of input reactions. We also show how to integrate putative reactions in the model.</p></div>\",\"PeriodicalId\":101162,\"journal\":{\"name\":\"Simulation Practice and Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0928-4869(00)00006-9\",\"citationCount\":\"66\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Simulation Practice and Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0928486900000069\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Simulation Practice and Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0928486900000069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper introduces a graph-oriented representation of metabolism, and shows how to apply the shortest path algorithm to reconstruct metabolic pathways. Our metabolic model is constructed from molecular structures of compounds and reaction formulas of enzymes, and its output is all the logically possible pathways consisting of input reactions. We also show how to integrate putative reactions in the model.