| 1. |
- Dell'Acqua, Pierangelo, 1963-, et al.
(författare)
-
Modelling Adaptive Controllers with Evolving Logic Programming
- 2006
-
Ingår i: Informatics in Control, Automation and Robotics,2006. - Procs. Intelligent Control Systems and Optimization Vol.1. ISBN:972-8865-59-7 : INSTICC Press. ; , s. 107-
-
Konferensbidrag (refereegranskat)
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
- Gustafsson, Mika, 1977-, et al.
(författare)
-
Comparison and validation of community structures in complex networks
- 2006
-
Ingår i: Physica A. - : Elsevier BV. - 0378-4371 .- 1873-2119. ; 367, s. 559-576
-
Tidskriftsartikel (refereegranskat)abstract
- The issue of partitioning a network into communities has attracted a great deal of attention recently. Most authors seem to equate this issue with the one of finding the maximum value of the modularity, as defined by Newman. Since the problem formulated this way is believed to be NP-hard, most effort has gone into the construction of search algorithms, and less to the question of other measures of community structures, similarities between various partitionings and the validation with respect to external information.Here we concentrate on a class of computer generated networks and on three well-studied real networks which constitute a bench-mark for network studies; the karate club, the US college football teams and a gene network of yeast. We utilize some standard ways of clustering data (originally not designed for finding community structures in networks) and show that these classical methods sometimes outperform the newer ones. We discuss various measures of the strength of the modular structure, and show by examples features and drawbacks. Further, we compare different partitions by applying some graph-theoretic concepts of distance, which indicate that one of the quality measures of the degree of modularity corresponds quite well with the distance from the true partition. Finally, we introduce a way to validate the partitionings with respect to external data when the nodes are classified but the network structure is unknown. This is here possible since we know everything of the computer generated networks, as well as the historical answer to how the karate club and the football teams are partitioned in reality. The partitioning of the gene network is validated by use of the Gene Ontology database, where we show that a community in general corresponds to a biological process.
|
|
| 7. |
- Gustafsson, Mika, 1977-, et al.
(författare)
-
Constructing and analyzing a large-scale gene-to-gene regulatory network Lasso-constrained inference and biological validation
- 2005
-
Ingår i: IEEE/ACM Transactions on Computational Biology & Bioinformatics. - 1545-5963 .- 1557-9964. ; 2:3, s. 254-261
-
Tidskriftsartikel (refereegranskat)abstract
- We construct a gene-to-gene regulatory network from time-series data of expression levels for the whole genome of the yeast Saccharomyces cerevisae, in a case where the number of measurements is much smaller than the number of genes in the network. This network is analyzed with respect to present biological knowledge of all genes (according to the Gene Ontology database), and we find some of its large-scale properties to be in accordance with known facts about the organism. The linear modeling employed here has been explored several times, but due to lack of any validation beyond investigating individual genes, it has been seriously questioned with respect to its applicability to biological systems. Our results show the adequacy of the approach and make further investigations of the model meaningful.
|
|
| 8. |
|
|
| 9. |
- Lombardi, Anna, 1965-, et al.
(författare)
-
Controllability analysis of networks
- 2007
-
Ingår i: Physical Review E. Statistical, Nonlinear, and Soft Matter Physics. - 1063-651X .- 1095-3787. ; 75:056110
-
Tidskriftsartikel (refereegranskat)abstract
- The concept of controllability of linear systems from control theory is applied to networks inspired by biology. A node is in this context controllable if an external signal can be applied which can adjust the level (e.g., protein concentration) of the node in a finite time to an arbitrary value, regardless of the levels of the other nodes. The property of being downstream of the node to which the input is applied turns out to be a necessary but not a sufficient condition for being controllable. An interpretation of the controllability matrix, when applied to networks, is also given. Finally, two case studies are provided in order to better explain the concepts, as well as some results for a gene regulatory network of fission yeast.
|
|
