Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis Methods for Dynamic Conceptual Graphs
ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Modeling and querying biomolecular interaction networks
Theoretical Computer Science - Special issue: Computational systems biology
Formal concept analysis for the identification of combinatorial biomarkers in breast cancer
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Conceptual representation of gene expression processes
KONT'07/KPP'07 Proceedings of the First international conference on Knowledge processing and data analysis
Proceedings of the Third international conference on Formal Concept Analysis
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Counting pseudo-intents and #p-completeness
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Formal concept analysis in knowledge discovery: a survey
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
Review: Formal concept analysis in knowledge processing: A survey on applications
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Our aim is to build a set of rules, such that reasoning over temporal dependencies within gene regulatory networks is possible. The underlying transitions may be obtained by discretizing observed time series, or they are generated based on existing knowledge, e.g. by Boolean networks or their nondeterministic generalization. We use the mathematical discipline of formal concept analysis (FCA), which has been applied successfully in domains as knowledge representation, data mining or software engineering. By the attribute explorationalgorithm, an expert or a supporting computer program is enabled to decide about the validity of a minimal set of implications and thus to construct a sound and complete knowledge base. From this all valid implications are derivable that relate to the selected properties of a set of genes. We present results of our method for the initiation of sporulation in Bacillus subtilis. However the formal structures are exhibited in a most general manner. Therefore the approach may be adapted to signal transduction or metabolic networks, as well as to discrete temporal transitions in many biological and nonbiological areas.