title: An novel frequent probability pattern mining algorithm based on circuit simulation method in uncertain biological networks.
abstract: BACKGROUND
  Motif mining has always been a hot research topic in bioinformatics. Most of current research on biological networks focuses on exact motif mining. However, due to the inevitable experimental error and noisy data, biological network data represented as the probability model could better reflect the authenticity and biological significance, therefore, it is more biological meaningful to discover probability motif in uncertain biological networks. One of the key steps in probability motif mining is frequent pattern discovery which is usually based on the possible world model having a relatively high computational complexity.
  
  
  METHODS
  In this paper, we present a novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks. First, the partition based efficient search is applied to the non-tree like subgraph mining where the probability of occurrence in random networks is small. Then, an algorithm of probability isomorphic based on circuit simulation is proposed. The probability isomorphic combines the analysis of circuit topology structure with related physical properties of voltage in order to evaluate the probability isomorphism between probability subgraphs. The circuit simulation based probability isomorphic can avoid using traditional possible world model. Finally, based on the algorithm of probability subgraph isomorphism, two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probability patterns from the clusters.
  
  
  RESULTS
  The experiment results on data sets of the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae show that the proposed method can efficiently discover the frequent probability subgraphs. The discovered subgraphs in our study contain all probability motifs reported in the experiments published in other related papers.
  
  
  CONCLUSIONS
  The algorithm of probability graph isomorphism evaluation based on circuit simulation method excludes most of subgraphs which are not probability isomorphism and reduces the search space of the probability isomorphism subgraphs using the mismatch values in the node voltage set. It is an innovative way to find the frequent probability patterns, which can be efficiently applied to probability motif discovery problems in the further studies.
authors.forename: Jieyue
authors.initials: J
authors.lastname: He
authors.forename: Chunyan
authors.initials: C
authors.lastname: Wang
authors.forename: Kunpu
authors.initials: K
authors.lastname: Qiu
authors.forename: Wei
authors.initials: W
authors.lastname: Zhong
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D003196:Computer Graphics; D004926:Escherichia coli / Q000235:genetics / Q000378:metabolism; D053263:Gene Regulatory Networks; D010363:Pattern Recognition, Automated / Q000379:methods*; D025941:Protein Interaction Mapping; D012441:Saccharomyces cerevisiae / Q000235:genetics / Q000378:metabolism; D035501:Uncertainty