ACM Home Page
Please provide us with feedback. Feedback
Protein-protein functional association prediction using genetic programming
Full text PdfPdf (219 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 10th annual conference on Genetic and evolutionary computation table of contents
Atlanta, GA, USA
POSTER SESSION: Bioinformatics and computational biology Posters table of contents
Pages 347-348  
Year of Publication: 2008
ISBN:978-1-60558-130-9
Authors
Beatriz Garcia  Universidad Carlos III de Madrid, Leganes - Madrid, Spain
Ricardo Aler  Universidad Carlos III de Madrid, Leganes - Madrid, Spain
Agapito Ledezma  Universidad Carlos III de Madrid, Leganes - Madrid, Spain
Araceli Sanchis  Universidad Carlos III de Madrid, Leganes - Madrid, Spain
Sponsors
ACM: Association for Computing Machinery
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 31,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1389095.1389156
What is a DOI?

ABSTRACT

Determining if a group of proteins are functionally associated among themselves is an open problem in molecular biology. Within our long term goal of applying Genetic Programming (GP) to this domain, this paper evaluates the feasibility of GP to predict if a given pair of proteins interacts. GP has been chosen because of its potential flexibility in many aspects, such as the definition of operations. In this paper, the if-unknown operation is defined, which semantically is the most appropriate in this domain for handling missing values. We have also used the Tarpeian bloat control method to decrease the computational time and the solution size. Our results show that GP is feasible for this domain and that the Tarpeian method can obtain large improvements in search efficiency and interpretability of solutions.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Koza J. Genetic Programming II. MIT Press, 1994.
 
2
Poli R. A Simple but Theoretically--Motivated Method to Control Bloat in Genetic Programming. In Proceedings of EuroGP'03. Springer Berlin, (Apr 2003), 43--76.
 
3
Valencia A. and Pazos F. Computational methods for the prediction of protein interactions. Curr. Opin. Struct. Biol., 12, 3 (Jun 2002), 368--373.
 
4
 
5
Zongker D. and Punch B. lil-gp. Michigan State University, Michigan, 1998. http://garage.cse.msu.edu/software/lil-gp/.

Collaborative Colleagues:
Beatriz Garcia: colleagues
Ricardo Aler: colleagues
Agapito Ledezma: colleagues
Araceli Sanchis: colleagues