Computing atom mappings for biochemical reactions without subgraph isomorphism

Journal of Computational Biology

Volumn 18, Issue 1, 2011, Pages 43-58

  Heinonen, Markus ^a   Lappalainen, Sampsa ^a   Mielikäinen, Taneli ^b   Rousu, Juho ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

^b NOKIA RESEARCH CENTER   (United States)

Author keywords

algorithms; biochemical networks

Indexed keywords

AMINO ACID;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; CHEMICAL MODEL; CHEMISTRY; COMPUTER SIMULATION; HUMAN; METABOLISM; SYSTEMS BIOLOGY;

ALGORITHMS; AMINO ACIDS; COMPUTER SIMULATION; HUMANS; METABOLIC NETWORKS AND PATHWAYS; MODELS, BIOLOGICAL; MODELS, CHEMICAL; SYSTEMS BIOLOGY;

EID: 78651301358     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2009.0216     Document Type: Article

References (53)

1. Akutsu, T. 2004. Efficient extraction of mapping rules of atoms from enzymatic reaction data. J. Comput. Biol. 11, 449-462.
2. Arita, M. 2000. Graph modeling of metabolism. J. Jpn. Soc. Artif. Intell. 15, 703-710.
3. Arita, M. 2003. In silico atomic tracing by substrate-product relationships in Escherichia coli intermediary metabolism. Genome Res. 13, 2455-2466.
4. Arita, M. 2005. Introduction to the arm database: database on chemical transformation in metabolism for tracing pathways, 193-210. In: Metabolomics, The Frontier of Systems Biology. Volume 4. Springer, Tokyo.
5. Bereg, S. 2008. Topological indices in combinatorial chemistry, 419-463. In: Bioinformatics Algorithms: Techniques and Applications. John Wiley & Sons, Inc., New York.
6. Blanskby, S., and Ellison, G. 2003. Bond dissociation energies of organic molecules. Acc. Chem. Res. 36, 255-263.
7. Blum, T., and Kohlbacher, O. 2008. Using atom mapping rules for an improved detection of relevant routes in weighted metabolic networks. J. Comput. Biol. 15, 565-576.
8. Bron, C., and Kerbosch, J. 1971. Finding all cliques of an undirected graph. Commun. ACM 16, 575-577.
9. Bunke, H. 2000. Graph matching: theoretical foundations, algorithms, and applications. Proc. Vision Interface 82-88.
10. Cazals, F., and Karande, C. 2005. An algorithm for reporting maximal c-cliques. Theor. Comput. Sci. 349, 484-490.
11. Cazals, F., and Karande, C. 2008. A note on the problem of reporting maximal cliques. Theor. Comput. Sci. 407, 564-568.
12. Cone, M., Venkataraghaven, R., and McLafferty, F. 1977. Molecular structure comparison program for the identification of maximal common substructures. J. Am. Chem. Soc. 99, 7668-7671.
13. Cordella, L., Foggia, P., Sansone, C., et al. 2004. A (sub)graph isomoprhism algorithm for matching large graphs. IEEE Trans. Patt. Anal. Mach. Intell. 26, 1367-1372.
14. Cordella, L.P., Foggia, P., Sansone, C., et al. 1999. Performance evaluation of the vf graph matching algorithm. Proc. ICIAP-99 1172.
15. Crabtree, J.D., and Mehta, D.P. 2009. Automatic reaction mapping. ACM J. Exp. Algorithms 13.
16. de Graaf, C., Vermeulen, N.P.E., and Feenstra, K.A. 2005. Cytochrome p450 in silico: an integrative modeling approach. J. Med. Chem. 48, 2725-2755.
17. Dechter, R., and Pearl, J. 1985. Generalized best-first search strategies and the optimality of A*. J. ACM 32, 505-536.
18. Duarte, N.C., Becker, S.A., Jamshidi, N., et al. 2007. Global reconstruction of the human metabolic network based on genomic and bibliomic data. Proc. Nat. Acad. Sci. USA 104.
19. Gao, J., Ma, S., Major, D.T., et al. 2006. Mechanisms and free energies of enzymatic reactions. Chem. Rev. 106, 3188-3209.
20. Glover, J.R., Chapple, C.C.S., Rothwell, S., et al. 1988. Allylglucosinolate biosynthesis in Brassica carinata. Phytochemistry 27, 1345-1348.
21. Goto, S., Okuno, Y., Hattori, M., et al. 2002. LIGAND: a database of chemical compounds and reactions in biological pathways. Nucleic Acids Res. 30, 402-404.
22. Hart, P.E., Nilsson, N.J., and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybernet. 4, 100-107.
23. Hattori, M., Okuno, Y., Goto, S., et al. 2003a. Heuristics for chemical compound matching. Genome Inform. 14, 144-153.
24. Hattori, M., Okuno, Y., Goto, S., et al. 2003b. Development of a chemical structure comparison method for integrated analysis of chemical and genomic information in the metabolic pathways. J. Am. Chem. Soc. 125, 11853-11865.
25. Hogiri, T., Furusawa, C., Shinfuku, Y., et al. 2008. Analysis of metabolic network based on conservation of molecular structure. BioSystems 95, 175-178.
26. Kanehisa, M., and Goto, S. 2000. KEGG: Kyoto Encyclopedia of Genes and Genomes. Nucleic Acids Res. 28, 27-30.
27. Kanehisa, M., Goto, S., Hattori, M., et al. 2006. From genomics to chemical genomics: new developments in kegg. Nucleic Acids Res. 34, 354-357.
28. Karp, P.D., Arnaud, M., Collado-Vides, J., et al. 2004. The E. coli EcoCyc Database: no longer just a metabolic pathway database. ASM News 70, 25-30.
29. Kell, D. 2004. Metabolomics and systems biology: making sense of the soup. Curr. Opin. Microbiol. 7, 296-307.
30. Kitano, H. 2002. Systems biology: a brief overview. Science 295, 1662-1664.
31. Koch, I. 2001. Enumerating all connected maximal common subgraphs in two graphs. Theor. Comput. Sci. 250, 1-30.
32. Kotera, M., Hattori, M., Oh, M.A., et al. 2004. Rpair: a reactant-pair database representing chemical changes in enzymatic reactions. Genome Inform. 15, P062.
33. Levi, G. 1972. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo 9, 1-12.
34. Lynch, M. 1968. Storage and retrieval of information on chemical structures by computer. Endeavour 27, 68-73.
35. Lynch, M., and Willett, P. 1978. The automatic detection of chemical reaction sites. J. Chem. Inform. Comput. Sci. 18.
36. Mavrovouniotis, M. 1991. Estimation of standard Gibbs energy changes of biotransformations. J. Biol. Chem. 266, 14440-14445.
37. McGregor, J., and Willett, P. 1981. Use of a maximal common subgraph algorithm in the automatic identification of the ostensible bond changes occurring in chemical reactions. J. Chem. Inform. Comput. Sci. 21.
38. Menküc, B., Gille, C., and Holzhü tter, H. 2008. Computer aided optimization of carbon atom labeling for tracer experiments. Genome Inform. 20, 270-276.
39. Mu, F., Williams, R., Unkefer, C., et al. 2007. Carbon-fate maps for metabolic reactions. Bioinformatics 23, 3193-3199.
40. Munkres, J. 1957. Algorithms for the assignment and transporation problems. J. Soc. Indust. Appl. Math. 5, 32-38.
41. Pitkänen, E., Rantanen, A., Rousu, J., et al. 2008. A computational method for reconstructing gapless metabolic networks, 288-302. In: Bioinformatics Research and Development. Communications in Computer and Information Science. Springer, New York.
42. Rantanen, A., Mielikäinen, T., Rousu, J., et al. 2006. Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxes. Bioinformatics 22, 1198-1206.
43. Rantanen, A., Rousu, J., Jouhten, P., et al. 2008. An analytic and systematic framework for estimating metabolic flux ratios from 13C tracer experiments. BMC Bioinform. 9, 266-285.
44. Raymond, J., and Willett, P. 2002. Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J. Comput. Aided Mol. Design 16, 521-533. (Pubitemid 36013605)
45. Riesen, K., Neuhaus, M., and Bunke, H. 2007. Bipartite graph matching for computing the edit distance of graphs. Graph Based Represent. Patt. Recogn. 1-12.
46. Rousu, J., Rantanen, A., Maaheimo, H. et al. 2003. A method for estimating metabolic fluxes from incomplete isotopomer information. Lect. Notes Comput. Sci. 2602, 88-103.
47. Sussenguth, E. 1965. A graph-theoretical algorithm for matching chemical structures. J. Chem. Doc. 5, 36-43.
48. Tarjan, R. 1977. Graph algorithms in chemical computation, 1-20. In Christofferson, R., ed. lgorithms for Chemical Computations. American Chemical Society, Washington, DC.
49. Uehara, R., Toda, S., and Nagoya, T. 2005. Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discrete Appl. Math. 145, 479-482.
50. Wang, T., and Zhou, J. 1997. EMCSS: a new method for maximal common substructure search. J. Chem. Inform. Comput. Sci. 37, 828-834.
51. Wipke, W., and Dyott, T. 1974. Stereochemically unique naming algorithm. J. Am. Chem. Soc. 96, 4834-4842.
52. Xu, J., 1996. GMA: A generic match algorithm for structural homomorphism, isomorhism, and maximal common substructure match and its applications. J. Chem. Inform. Comput. Sci. 36, 25-34.
53. Yamanishi, Y., Hattori, M., Kotera, M., et al. 2009. E-zyme: predicting potential ec numbers from the chemical transformation pattern of substrate-product pairs. Bioinformatics 25, 179-186.