PMC:1570465 / 15685-16304 JSONTXT

{"target":"https://pubannotation.org/docs/sourcedb/PMC/sourceid/1570465","sourcedb":"PMC","sourceid":"1570465","source_url":"https://www.ncbi.nlm.nih.gov/pmc/1570465","text":"The motif finding problem can be formulated as an ILP as follows. For a graph G = (V, E) corresponding to the motif finding problem, where V = V1 ∪ ... ∪ VN and E = {(u, v): u ∈ Vi, v ∈ Vj, i ≠ j}, we introduce a binary decision variable xu for every vertex u, and a binary decision variable yuv for every edge (u, v). Setting xu to 1 corresponds to selecting vertex u for the clique and thus choosing the sequence position corresponding to u in the alignment. Edge variable yuv is set to 1 if both endpoints u and v are selected for the clique. Then the following ILP solves the motif finding problem formulated above:","tracks":[]}