Loading [a11y]/accessibility-menu.js
Some results on topological colored motifs in metabolic networks | IEEE Conference Publication | IEEE Xplore

Some results on topological colored motifs in metabolic networks

Publisher: IEEE

Abstract:

In this work, we address the topological colored motif search problem in metabolic networks. This problem is a concern in biology, which seeks to describe the functions a...View more

Abstract:

In this work, we address the topological colored motif search problem in metabolic networks. This problem is a concern in biology, which seeks to describe the functions and the evolution of metabolism. Recently, several variations of this problem have been studied. Here, we present some hardness results for finding motifs. Furthermore, we describe the first polynomial algorithm for the case in which the motif is a colorful tree. We also detail a data structure that allows finding all of these types of motifs in a metabolic network.
Date of Conference: 10-13 November 2013
Date Added to IEEE Xplore: 09 January 2014
Electronic ISBN:978-1-4799-3163-7
Publisher: IEEE
Conference Location: Chania, Greece

References

References is not available for this document.