Efficient path kernels for reaction function prediction

BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms

Volumn , Issue , 2012, Pages 202-207

  Heinonen, Markus ^a   Välimäki, Niko ^a   Mäkinen, Veli ^a   Rousu, Juho ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Compressed data structures; Graph kernels; Hierarchical classification; Reaction graph; XBW transform

Indexed keywords

BURROWS WHEELER TRANSFORM; COMPUTATIONAL COSTS; EFFICIENT PATH; FAST COMPUTATION; GRAPH KERNELS; HIERARCHICAL CLASSIFICATION; PATH INDEX; PATH-BASED; PREDICTION ACCURACY; PREDICTIVE PERFORMANCE; REACTION FUNCTIONS; REACTION GRAPH; SIMILARITY MEASURE; STRUCTURED DATA; SUBGRAPHS;

ALGORITHMS; DATA STRUCTURES; MATHEMATICAL MODELS;

BIOINFORMATICS;

EID: 84861969594     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Astikainen, K., Holm, L., Pitkänen, E., Szedmak, S., and Rousu, J. (2011). Structured output prediction of novel enzyme function with reaction kernels. In Biomedical Engineering Systems and Technologies, pages 367-378. Springer.
2. Borgwardt, K., Ong, C., Schönauer, S., Vishwanathan, S., Smola, A., and Kriegel, H.-P. (2005). Protein function prediction via graph kernels. Bioinformatics, 21:i47.
3. Demco, A. (2009). Graph Kernel Extension and Experiments with Application to Molecule Classification, Lead Hopping and Multiple Targets. PhD thesis, University of Southampton.
4. Felix, H., Rossello, F., and Valiente, G. (2005). Optimal artificial chemistries and metabolic pathways. In Proc. 6th Mexican Int. Conf. Computer Science, pages 298-305. IEEE Computer Science Press.
5. Ferragina, P., Luccio, F., Manzini, G., and Muthukrishnan, S. (2009). Compressing and indexing labeled trees, with applications. J. ACM, 57:4:1-4:33.
6. Ferragina, P., Manzini, G., Mäkinen, V., and Navarro, G. (2007). Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms (TALG), 3(2):article 20.
7. Gärtner, T. (2003). A survey of kernels for structured data. ACM SIGKDD Explorations Newsletter, 5:49-58.
8. Grossi, R., Gupta, A., and Vitter, J. S. (2004). When indexing equals compression: experiments with compressing suffix arrays and applications. In Proc. 15th annual ACM-SIAM Symposium on Discrete Algorithms, pages 636-645, Philadelphia, PA, USA. SIAM.
9. Heinonen, M., Lappalainen, S., Mielikäinen, T., and Rousu, J. (2011). Computing atom mappings for biochemical reactions without subgraph isomorphism. J. Comp. Biology, 18:43-58.
10. Jacobson, G. (1989). Succinct Static Data Structures. PhD thesis, Carnegie-Mellon. CMU-CS-89-112.
11. Kashima, H., Tsuda, K., and Inokuchi, A. (2003). Marginalized kernels between labeled graphs. In Proc. 20th Int. Conf. on Machine Learning (ICML), pages 321-328.
12. Mahe, P., Ueda, N., Akutsu, T., Perret, J.-L., and Vert, J.-P. (2005). Graph kernels for molecular structure-activity relationship analysis with support vector machines. J. Chem. Inf. Model., 45:939-951.
13. Ralaivola, L., Swamidass, S., Saigo, H., and Baldi, P. (2005). Graph kernels for chemical informatics. Neural Networks, 18:1093-1110.
14. Rousu, J., Saunders, C., Szedmak, S., and Shawe-Taylor, J. (2007). Efficient algorithms for max-margin structured classification. Predicting Structured Data, pages 105-129.
15. Saigo, H., Hattori, M., Kashima, H., and Tsuda, K. (2010). Reaction graph kernels predict ec numbers of unknown enzymatic reactions in plant secondary metabolism. BMC Bioinformatics, 11:S31.
16. Shawe-Taylor, J. and Christianini, N. (2004). Kernel Methods for Pattern Analysis. Cambridge University Press.