Author: Marcus Ludwig; Louis-Félix Nothias; Kai Dührkop; Irina Koester; Markus Fleischauer; Martin A. Hoffmann; Daniel Petras; Fernando Vargas; Mustafa Morsy; Lihini Aluwihare; Pieter C. Dorrestein; Sebastian Böcker
Title: ZODIAC: database-independent molecular formula annotation using Gibbs sampling reveals unknown small molecules Document date: 2019_11_16
ID: 03uonbrv_76
Snippet: Finally, we consider two problem variants: First, we may allow that some colors from C are absent from A; in this case, A is called colorful. We can encode this variant in the original problem, by adding a dummy node for each color which is connected to no other node. Second, we may assume that only edges carry weight. We can encode the Multicolored Subgraph problem in this variant, by adding a dummy color for each color and a dummy node for each.....
Document: Finally, we consider two problem variants: First, we may allow that some colors from C are absent from A; in this case, A is called colorful. We can encode this variant in the original problem, by adding a dummy node for each color which is connected to no other node. Second, we may assume that only edges carry weight. We can encode the Multicolored Subgraph problem in this variant, by adding a dummy color for each color and a dummy node for each node, such that if a node has a certain color, then the dummy node has the corresponding dummy color. We connect each node to its dummy node, and transfer the weight of the node to the corresponding edge. Hence, our complexity results also hold for these variants.
Search related documents:
Co phrase search for related documents- Try single phrases listed below for: 1
Co phrase search for related documents, hyperlinks ordered by date