Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Vert, J.-P.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Vert, J.-P.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 18 no. 90001 2002
Pages S276-S284
© 2002 Oxford University Press

A tree kernel to analyse phylogenetic profiles

Jean-Philippe Vert

Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji, Kyoto, 611-0011, Japan

Received on January 24, 2002 ; revised on March 26, 2002 ; accepted on March 26, 2002

Motivation: The phylogenetic profile of a protein is a string that encodes the presence or absence of the protein in every fully sequenced genome. Because proteins that participate in a common structural complex or metabolic pathway are likely to evolve in a correlated fashion, the phylogenetic profiles of such proteins are often ‘similar’ or at least ‘related’ to each other. The question we address in this paper is the following: how to measure the ‘similarity’ between two profiles, in an evolutionarily relevant way, in order to develop efficient function prediction methods?

Results: We show how the profiles can be mapped to a high-dimensional vector space which incorporates evolutionarily relevant information, and we provide an algorithm to compute efficiently the inner product in that space, which we call the tree kernel. The tree kernel can be used by any kernel-based analysis method for classification or data mining of phylogenetic profiles.

As an application a Support Vector Machine (SVM) trained to predict the functional class of a gene from its phylogenetic profile is shown to perform better with the tree kernel than with a naive kernel that does not include any information about the phylogenetic relationships among species. Moreover a kernel principal component analysis (KPCA) of the phylogenetic profiles illustrates the sensitivity of the tree kernel to evolutionarily relevant variations.

Availability: All data and software used are freely and publicly available upon request.

Contact: Jean-Philippe.Vert{at}mines.org

Keywords: phylogenetic profile; tree; kernel; support vector machine; gene function prediction.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
L. Jacob and J.-P. Vert
Protein-ligand interaction prediction: an improved chemogenomics approach
Bioinformatics, October 1, 2008; 24(19): 2149 - 2156.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
O. Gonzalez and R. Zimmer
Assigning functional linkages to proteins using phylogenetic profiles and continuous phenotypes
Bioinformatics, May 15, 2008; 24(10): 1257 - 1263.
[Abstract] [Full Text] [PDF]


Home page
Genome ResHome page
O. X. Cordero, B. Snel, and P. Hogeweg
Coevolution of gene families in prokaryotes
Genome Res., March 1, 2008; 18(3): 462 - 468.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
D. Barker, A. Meade, and M. Pagel
Constrained models of evolution lead to improved prediction of functional linkage from correlated gain and loss of genes
Bioinformatics, January 1, 2007; 23(1): 14 - 20.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.