A Dominating Set Approach to Structural Controllability of Unidirectional Bipartite Networks
スポンサーリンク
概要
- 論文の詳細を見る
In this report, we present a dominating set (DS)-based approach to structural controllability of unidirectional bipartite networks, where we assume that driver nodes (i.e., control nodes) are selected from one side of nodes and the purpose is to control all nodes in the other side. We show that if DS is selected as a set of driver nodes, the system can be structurally controllable under the assumption that each driver node can control its outgoing edges independently. We also show a relationship between the size of the minimum dominating set and the exponent of the degree distribution in scale-free networks.
- 2013-09-19
著者
-
Tatsuya Akutsu
Bioinformatics Center, Institute for Chemical Research, Kyoto University
-
Tatsuya Akutsu
Bioinformatics Center Institute For Chemical Research Kyoto University
-
Tatsuya Akutsu
Bioinformatics Center Institute For Chemical Research Kyoto Univerty
関連論文
- Prediction of Protein Folding Rates from Structural Topology and Complex Network Properties
- Prediction of Protein Folding Rates from Structural Topology and Complex Network Properties
- RNA-RNA Interaction Prediction Using Integer Programming with Threshold Cut
- A Quadsection Algorithm for Grammar-Based Image Compression
- Analyses and Algorithms for Predecessor and Control Problems for Boolean Networks of Bounded Indegree
- Conditional Random Field Approach to Prediction of Protein-protein Interactions Using Domain Information
- Integer Programming and Dynamic Programming-based Methods of Optimizing Control Policy in Probabilistic Boolean Networks with Hard Constraints
- An Improved Clique-Based Method for Computing Edit Distance between Rooted Unordered Trees
- Prediction of protein residue contacts using discriminative random field
- Prediction of protein residue contacts using discriminative random field
- Efficient Computation of Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles
- Prediction of RNA Secondary Structures with Binding Sites Using Dynamic Programming Algorithm
- Message from the Editor-in-Chief
- Message from the Editor-in-Chief
- Message from the Editor-in-Chief
- Protein complex prediction via improved verification methods using constrained domain-domain matching
- Predicting Protein-RNA Residue-base Contacts Using Two-dimensional Conditional Random Field
- Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment
- Inferring Strengths of Protein-Protein Interactions Using Support Vector Regression
- Evaluating Effectiveness of Accessibility to Infer RNA-RNA Interactions
- Survival Analysis by Penalized Regression and Matrix Factorization
- A Dominating Set Approach to Structural Controllability of Unidirectional Bipartite Networks
- Prediction of Heterodimeric Protein Complexes from Weighted Protein-Protein Interaction Networks Using Novel Features and Kernel Functions
- Prediction of Heterodimeric Protein Complexes from Weighted Protein-Protein Interaction Networks Using Novel Features and Kernel Functions
- Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
- Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
- Algorithms for Finding a Largest Common Subtree of Bounded Degree
- Parallelization of Enumerating Tree-like Chemical Compounds by Breadth-first Search Order
- Prediction of Heterotrimeric Protein Complexes by Two-phase Learning Using Neighboring Kernels
- Prediction of Heterotrimeric Protein Complexes by Two-phase Learning Using Neighboring Kernels
- Grammar-based Compression for Multiple Trees Using Integer Programming
- Grammar-based Compression for Multiple Trees Using Integer Programming