Biomedical subjects

Peter Grindrod

Publications and source records attributed to Peter Grindrod.

3 recordsLinked to original sources

PubMed2004

Review of uses of network and graph theory concepts within proteomics.

The size and nature of data collected on gene and protein interactions has led to a rapid growth of interest in graph theory and modern techniques for describing, characterizing and comparing networks. Simultaneously, this is a field of growth within mathematics and theoretical physics, where the global properties, and emergent behavior of networks, as a function of the local properties has long been studied. In this review, a number of approaches for exploiting modern network theory to help describe and analyze different data sets and problems associated with proteomic data are considered. This review aims to help biologists find their way towards useful ideas and references, yet may also help scientists from a mathematics and physics background to understand where they may apply their expertise.

Models, Theoretical↗

PubMed2003

Modeling proteome networks with range-dependent graphs.

In this paper we consider the problem of characterizing and modeling large-scale protein-protein association networks using a class of range-dependent graphs which possess appropriate small world properties. These graphs may be employed in representing given association network using a maximum likelihood approach. This in turn annotates every observed association with its 'range', representing the tendency for such an association to be transitive. The application of a very rapidly developing field of graph theory to the emerging field of proetemics is novel and allows for a many-to-many relationship between individual proteins and groupings of proteins, which in turn may correspond to distinct functional behavior.

Models, Biological↗

PubMed2002

Range-dependent random graphs and their application to modeling large small-world Proteome datasets.

In this paper we consider the problem of characterizing and modeling large-scale networks using classes of range-dependent graphs which possess appropriate small-world properties. The application we have in mind is to bioinformatics, where methods of rapid protein identification mean that such proteome datasets, listing various observed protein-protein associations, will become more and more prevalent. We introduce a class of range-dependent graphs, governed by a power law relating intervertex range to edge probability, which are amenable to analysis, and for which macroscopic graph parameters are given by explicit forms. We show how these may be employed in representing a given network using a maximum likelihood approach. This in turn annotates every given edge with its range, representing the tendency for such an association to be transitive. We apply this technique to published proteome data, and demonstrate that known protein associations are thus identified.

Journal Article↗