作者机构：
[ Wang, Jianxin ; Chen, Jianer ; Li, Min ] School of Information Science and Engineering, Central South University, Changsha 410083, China;[ Chen, Jianer ] Department of Computer Science, Texas A and M University, College Station, TX 77843, United States
关键词：
Cellular organizations - Functional module - Functional modules - Graph - International symposium - New algorithm - Protein interaction network - Protein interaction networks
作者机构：
[Shi, Feng; Feng, Qilong; Wang, Jianxin; Chen, Jianer] School of Information Science and Engineering, Central South University, China;[Chen, Jianer] Department of Computer Science and Engineering, Texas AandM University, United States
关键词：
Largest common subforest - Maximum agreement forest problems - Multiple trees - Phylogenetic trees - Polynomial time approximation algorithms - Rooted trees
作者机构：
[ Jianer, Chen ] Department of Computer Science, Texas AM University, College Station, TX 77843, United States;[ Jianer, Chen ; Yunlong, Liu ; Jianxin, Wang ] College of Information Science and Engineering, Central South University, Changsha 410083, China;[Yunlong, Liu ] School of Continuing Education, Hunan Normal University, Changsha 410012, China
作者机构：
[Feng, Qilong ; Wang, Jianxin ; Chen, Jianer ; Li, Shaohua ] School of Information Science and Engineering, Central South University, Changsha 410083, China;[ Chen, Jianer ] Department of Computer Science and Engineering, Texas AandM University, College Station, TX 77843-3112, United States
作者机构：
[ Chen, Jianer ; Wang, Jianxin ; Feng, Qilong ; Yao, Jinyi ] School of Information Science and Engineering, Central South University, Changsha 410083, China;[ Chen, Jianer ] Department of Computer Science and Engineering, Texas A and M University, College Station, TX 77843-3112, United States
作者机构：
[Shi, Feng ; Feng, Qilong ; Wang, Jianxin ; Chen, Jianer ] School of Information Science and Engineering, Central South University, China;[ Chen, Jianer ] Department of Computer Science and Engineering, Texas AandM University, United States
关键词：
Fixed-parameter tractable algorithms - Largest common subforest - Multiple trees - Parameterized algorithm - Phylogenetic trees - Rooted trees
作者机构：
[Guo, Jiong] Universitä[Guo, Jiong] t des Saarlandes, Campus E 1.4, D-66123 Saarbrü[Guo, Jiong] cken, Germany;[Wang, Jianxin; Chen, Jianer; Feng, Qilong; Luo, Weizhong] School of Information Science and Engineering, Central South University, Changsha 410083, China;[Luo, Weizhong] Hunan Financial and Economic University, Changsha 410205, China
作者机构：
[ Guo, Jiong ] Universitä[ Guo, Jiong ] t des Saarlandes, Campus E 1.7, D-66123 Saarbrü[ Guo, Jiong ] cken, Germany;[ Chen, Jianer ; Wang, Jianxin ] School of Information Science and Engineering, Central South University, Changsha 410083, China;[ Chen, Jianer ] Department of Computer Science and Engineering, Texas A and M University, College Station, TX 77843, United States
关键词：
Cograph - Edge addition - Graph G - NP-hard - Parameterized algorithm - Running time - Search trees
作者机构：
[Liu, Yunlong ; Wang, Jianxin ; Chen, Jianer ] College of Information Science and Engineering, Central South University, Changsha 410083, China;[Liu, Yunlong ] School of Further Education, Hunan Normal University, Changsha 410012, China;[ Chen, Jianer ] Department of Computer Science, Texas A and M University, College Station, TX 77843, United States
作者机构：
[ Guo, Jiong ] Universitä[ Guo, Jiong ] t des Saarlandes, Campus E 1.7, D-66123 Saarbrü[ Guo, Jiong ] cken, Germany;[ Wang, Jianxin ; Liu, Yunlong ; Chen, Jianer ; Xu, Chao ] School of Information Science and Engineering, Central South University, Changsha 410083, China;[Liu, Yunlong ] College of Mathematics and Computer Science, Ministry of Education of China, Hunan Normal University, Changsha 410081, China
作者机构：
[Feng, Qilong ; Wang, Jianxin ; Chen, Jianer ] School of Information Science and Engineering, Central South University, Changsha 410083, China;[ Chen, Jianer ] Department of Computer Science and Engineering, Texas A and M University, College Station, TX 77843-3112, United States
关键词：
Bipartite graphs - General graph - Graph matching problems - Graph matchings - New study - Packing problems - Parameterized algorithm - Polynomial-time algorithms - Upper Bound
作者机构：
[ Wang, Jianxin ; Chen, Jianer ; Feng, Qilong ; Zheng, Ying ] School of Information Science and Engineering, Central South University, Changsha 410083, China;[ Chen, Jianer ] Department of Computer Science and Engineering, Texas A and M University, College Station, TX 77843-3112, United States
关键词：
Decision problems - Dominating set problems - Dominating sets - Fixed parameters - Function values - Graph G - Minimum weight - Parameterized algorithm - Planar graph - Signed dominating function - Signed domination number - Social Networks
作者机构：
[ Jianer, Chen ] Department of Computer Science, Texas A and M University, College Station, TX 77843, United States;[Jianxin, Wang ; Xiaoshuang, Xu ; Jianer, Chen ] School of Information Science and Engineering, Central South University, Changsha 410083, China
摘要：
We study the parameterized complexity of a generalized matching problem, the P(2)-packing problem. The problem is NP-hard and has been studied by a number of researchers. In this paper, we provide further study of the structures of the P2-packing problem, and propose a new kernelization algorithm that produces a kernel of size 7k for the problem, improving the previous best kernel size 15k. The new kernelization leads to an improved algorithm for the problem with running time O* (2(4.142k)), improving the previous best algorithm of time O* (2(5.301k)).
作者机构：
[ Wang, Jianxin ; Chen, Jianer ; Xie, Minzhu ] School of Information Science and Engineering, Central South University, Changsha 410083, China;[Xie, Minzhu ] College of Physics and Information Science, Hunan Normal University, Changsha 410081, China;[ Chen, Jianer ] Department of Computer Science, Texas A and M University, College Station, TX 77843, United States
关键词：
Combinatorics - Computational modelling - DNA Sequencing - Dynamic programming algorithms - Exact algorithms - Genotype information - Haplotypes - Haplotyping - International conferences - Minimum error correction - Parameterized - Running time - Single-nucleotide polymorphism
摘要：
Essential proteins are indispensable for cellular life. It is of great significance to identify essential proteins that can help us understand the minimal requirements for cellular life and is also very important for drug design. However, identification of essential proteins based on experimental approaches are always time-consuming and expensive. With the development of high-throughput technology in the post-genomic era, more and more protein-protein interaction data can be obtained, which make us study essential proteins from the network level become possible. There have been a series of computational approaches proposed for predicting essential proteins based on network topologies. Most of these topology based essential protein discovery methods were to use network centrality. In this paper, we investigate the essential proteins' topological characters from a completely new perspective. To our knowledge it is the first time that topology potential is used to identify essential proteins from protein-protein interaction network. The basic idea is that each protein in the network can be viewed as a material particle which creates a potential field around itself and the interaction of all proteins forms a topological field over the network. By defining and computing the value of each protein's topology potential, we can obtain a more precise ranking which reflects the importance of proteins from the protein-protein interaction network. The experiment results show that topology potential outperforms traditional topology measures: Degree Centrality (DC), Betweenness Centrality (BC), Closeness Centrality (CC), Subgraph Centrality(SC), Eigenvector Centrality(EC), Information Centrality(IC), and Sum of ECC (NC) for predicting essential proteins. In addition, these centrality measures are improved on their performance for identifying essential proteins in biological network when controlled by topology potential.
作者：
Li, Min;Chen, Xiaopei;Ni, Peng;Wang, Jianxin;Pan, Yi
作者机构：
[ Wang, Jianxin ; Li, Min ; Chen, Xiaopei ; Ni, Peng ; Pan, Yi ] School of Information Science and Engineering, Central South University, Changsha;[ Wang, Jianxin ; Li, Min ; Chen, Xiaopei ; Ni, Peng ; Pan, Yi ] 410083, China;[ Pan, Yi ] Department of Computer Science, Georgia State University, Atlanta;[ Pan, Yi ] GA;[ Pan, Yi ] 30302-4110, United States
关键词：
Essential proteins - Gene Expression Data - Gene expression profiles - Network-based - Protein interaction networks - S.cerevisiae - Subcellular location - Time points