Issue No. 04 - October-December (2006 vol. 3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2006.55
The classic view of metabolism as a collection of metabolic pathways is being questioned with the currently available possibility of studying whole networks. Novel ways of decomposing the network into modules and motifs that could be considered as the building blocks of a network are being suggested. In this work, we introduce a new definition of motif in the context of metabolic networks. Unlike in previous works on (other) biochemical networks, this definition is not based only on topological features. We propose instead to use an alternative definition based on the functional nature of the components that form the motif, which we call a reaction motif. After introducing a formal framework motivated by biological considerations, we present complexity results on the problem of searching for all occurrences of a reaction motif in a network and introduce an algorithm that is fast in practice in most situations. We then show an initial application to the study of pathway evolution. Finally, we give some general features of the observed number of occurrences in order to highlight some structural features of metabolic networks.
Reaction motif, network motif, metabolic network, combinatorics, graph algorithms, subgraph isomorphism, evolution, leucine biosynthesis.
Vincent Lacroix, Cristina G. Fernandes, Marie-France Sagot, "Motif Search in Graphs: Application to Metabolic Networks", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. , pp. 360-368, October-December 2006, doi:10.1109/TCBB.2006.55