{"title":"基于矛盾的基因调控假设测试框架","authors":"S. Racunas, N. Shah, N. Fedoroff","doi":"10.1109/CSB.2003.1227430","DOIUrl":null,"url":null,"abstract":"We have developed a mathematical framework for representing and testing hypotheses about gene, protein, and signaling molecule interactions. It takes a hierarchical, contradiction-based approach, and can make use of multiple data sources to assess hypothesis viability and to generate a viability partial order over the space of hypotheses. We have developed an event-based formal language for the expression of such hypotheses. This language seamlessly integrates regulatory diagrams (graphical inputs) and structured English (text input) to maximize flexibility. We have developed a pre-topological formalism that allows us to make precise statements about hypothesis similarity and the convergence of iterative refinements of a base hypothesis. To this, we add mathematical machinery that allows us to make precise statements about control and regulation.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"142 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A contradiction-based framework for testing gene regulation hypotheses\",\"authors\":\"S. Racunas, N. Shah, N. Fedoroff\",\"doi\":\"10.1109/CSB.2003.1227430\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have developed a mathematical framework for representing and testing hypotheses about gene, protein, and signaling molecule interactions. It takes a hierarchical, contradiction-based approach, and can make use of multiple data sources to assess hypothesis viability and to generate a viability partial order over the space of hypotheses. We have developed an event-based formal language for the expression of such hypotheses. This language seamlessly integrates regulatory diagrams (graphical inputs) and structured English (text input) to maximize flexibility. We have developed a pre-topological formalism that allows us to make precise statements about hypothesis similarity and the convergence of iterative refinements of a base hypothesis. To this, we add mathematical machinery that allows us to make precise statements about control and regulation.\",\"PeriodicalId\":147883,\"journal\":{\"name\":\"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003\",\"volume\":\"142 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSB.2003.1227430\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSB.2003.1227430","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A contradiction-based framework for testing gene regulation hypotheses
We have developed a mathematical framework for representing and testing hypotheses about gene, protein, and signaling molecule interactions. It takes a hierarchical, contradiction-based approach, and can make use of multiple data sources to assess hypothesis viability and to generate a viability partial order over the space of hypotheses. We have developed an event-based formal language for the expression of such hypotheses. This language seamlessly integrates regulatory diagrams (graphical inputs) and structured English (text input) to maximize flexibility. We have developed a pre-topological formalism that allows us to make precise statements about hypothesis similarity and the convergence of iterative refinements of a base hypothesis. To this, we add mathematical machinery that allows us to make precise statements about control and regulation.