.png){kind=icon}
返回
RANGI: A Fast List-Colored Graph Motif Finding Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/TCBB.2012.167.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a multiset of colors as the query and a list-colored graph, i.e., an undirected graph with a set of colors assigned to each of its vertices, in the NP-hard list-colored graph motif problem the goal is to find the largest connected subgraph such that one can select a color from the set of colors assigned to each of its vertices to obtain a subset of the query. This problem was introduced to find functional motifs in biological networks. We present a branch-and-bound algorithm named RANGI for finding and enumerating list-colored graph motifs. As our experimental results show, RANGI's pruning methods and heuristics make it quite fast in practice compared to the algorithms presented in the literature. We also present a parallel version of RANGI that achieves acceptable scalability.
Keyword:
Branch-and-bound algorithms
parallel algorithms
list-colored graphs
protein-interaction networks
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
引用论文
The GOA database in 2009-an integrated Gene Ontology Annotation resource.png)
NUCLEIC ACIDS RESEARCH
OAAI
NUCLEIC ACIDS RESEARCHIF13.1
OAAI分享收藏
查看更多内容