A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
We study the NP-hard LIST-COLORED GRAPH MOTIF problem which, given an undirected list-colored graph G = (V, E) and a multiset M of colors, asks for maximum-cardinality sets S ⊆ V and M ⊆ M such that G[S] is connected and contains exactly (with respect to multiplicity) the colors in M . LIST-COLORED GRAPH MOTIF has applications in the analysis of biological networks. We study LIST-COLORED GRAPH MOTIF with respect to three different parameterizations. For the parameters motif size |M | anddoi:10.1109/tcbb.2011.19 pmid:21282862 fatcat:7njunkcrnnfwrotq4xmhlukwgi