A more efficient search strategy for aging genes based on connectivity

  • Authors:

  • Luca Ferrarini;Luca Bertelli;Jacob Feala;Andrew D. Mcculloch;Giovanni Paternostro

  • Affiliations:

  • The Burnham Institute 10901 North Torrey Pines Road, La Jolla, CA 92037, USA;The Burnham Institute 10901 North Torrey Pines Road, La Jolla, CA 92037, USA;Department of Bioengineering, University of California San Diego, La Jolla, CA, USA;Department of Bioengineering, University of California San Diego, La Jolla, CA, USA;The Burnham Institute 10901 North Torrey Pines Road, La Jolla, CA 92037, USA

  • Venue:
  • Bioinformatics
  • Year:
  • 2005

Quantified Score

Hi-index 3.85

Visualization

Abstract

Motivation: Many aging genes have been found from unbiased screens in model organisms. Genetic interventions promoting longevity are usually quantitative, while in many other biological fields (e.g. development) null mutations alone have been very informative. Therefore, in the case of aging the task is larger and the need for a more efficient genetic search strategy is especially strong. Results: The topology of genetic and metabolic networks is organized according to a scale-free distribution, in which hubs with large numbers of links are present. We have developed a computational model of aging genes as the hubs of biological networks. The computational model shows that, after generalized damage, the function of a network with scale-free topology can be significantly restored by a limited intervention on the hubs. Analyses of data on aging genes and biological networks support the applicability of the model to biological aging. The model also might explain several of the properties of aging genes, including the high degree of conservation across different species. The model suggests that aging genes tend to have a higher number of connections and therefore supports a strategy, based on connectivity, for prioritizing what might otherwise be a random search for aging genes. Contact: giovanni@burnham.org