{"title":"提高基于遗传算法的基因组级代谢网络管理效率","authors":"Eddy J. Bautista, R. Srivastava","doi":"10.1145/2576768.2598218","DOIUrl":null,"url":null,"abstract":"Genome-scale metabolic modeling using constraint-based analysis is a powerful modeling paradigm for simulating metabolic networks. Models are generated via inference from genome annotations. However, errors in the annotation or the identity of a gene's function could lead to \"metabolic inconsistency\" rendering simulations infeasible. Uncovering the source of metabolic inconsistency is non-trivial due to network size and complexity. Recently published work uses genetic algorithms for curation by generating pools of models with randomly relaxed mass balance constraints. Models are evolved that allow feasible simulation while minimizing the number of constraints relaxed. Relaxed constraints represent metabolites likely to be the root of metabolic inconsistency. Although effective, the approach can result in numerous false positives. Here we present a strategy, MassChecker, which evaluates all of the relaxed mass balance constraints in each generation prior to the next round of evolution to determine if they had become consistent due to recombination/mutation. If so, these constraints are enforced. This approach was applied to the development of genome-scale metabolic model of B. anthracis. The model consisted of 1,049 reactions and 1,003 metabolites. The result was a 60% reduction in the number of relaxed mass balance constraints, significantly speeding up the curation process.","PeriodicalId":123241,"journal":{"name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhancing genetic algorithm-based genome-scale metabolic network curation efficiency\",\"authors\":\"Eddy J. Bautista, R. Srivastava\",\"doi\":\"10.1145/2576768.2598218\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Genome-scale metabolic modeling using constraint-based analysis is a powerful modeling paradigm for simulating metabolic networks. Models are generated via inference from genome annotations. However, errors in the annotation or the identity of a gene's function could lead to \\\"metabolic inconsistency\\\" rendering simulations infeasible. Uncovering the source of metabolic inconsistency is non-trivial due to network size and complexity. Recently published work uses genetic algorithms for curation by generating pools of models with randomly relaxed mass balance constraints. Models are evolved that allow feasible simulation while minimizing the number of constraints relaxed. Relaxed constraints represent metabolites likely to be the root of metabolic inconsistency. Although effective, the approach can result in numerous false positives. Here we present a strategy, MassChecker, which evaluates all of the relaxed mass balance constraints in each generation prior to the next round of evolution to determine if they had become consistent due to recombination/mutation. If so, these constraints are enforced. This approach was applied to the development of genome-scale metabolic model of B. anthracis. The model consisted of 1,049 reactions and 1,003 metabolites. The result was a 60% reduction in the number of relaxed mass balance constraints, significantly speeding up the curation process.\",\"PeriodicalId\":123241,\"journal\":{\"name\":\"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2576768.2598218\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2576768.2598218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Genome-scale metabolic modeling using constraint-based analysis is a powerful modeling paradigm for simulating metabolic networks. Models are generated via inference from genome annotations. However, errors in the annotation or the identity of a gene's function could lead to "metabolic inconsistency" rendering simulations infeasible. Uncovering the source of metabolic inconsistency is non-trivial due to network size and complexity. Recently published work uses genetic algorithms for curation by generating pools of models with randomly relaxed mass balance constraints. Models are evolved that allow feasible simulation while minimizing the number of constraints relaxed. Relaxed constraints represent metabolites likely to be the root of metabolic inconsistency. Although effective, the approach can result in numerous false positives. Here we present a strategy, MassChecker, which evaluates all of the relaxed mass balance constraints in each generation prior to the next round of evolution to determine if they had become consistent due to recombination/mutation. If so, these constraints are enforced. This approach was applied to the development of genome-scale metabolic model of B. anthracis. The model consisted of 1,049 reactions and 1,003 metabolites. The result was a 60% reduction in the number of relaxed mass balance constraints, significantly speeding up the curation process.