Novel characterization of proteomics maps by sequential neighborhoods of protein spots

We consider a characterization of proteomics maps based on an alternative kind of neighborhood graphs for the protein spots on 2-D gel. The novel approach considers for every protein spot only the nearest neighborhood consisting of protein spots of higher abundance. The approach has the simplicity and advantages of the recently introduced characterization of proteome maps based on considering the nearest neighborhoods of protein spots, but it also has important additional desirable computational features. The characterization of the nearest neighborhood graphs of 2-D gel proteomics maps is sensitive to the number of spots considered and may lead to changes in the degree of similarity of different maps when the number of points has been changed, thus imposing restrictions on the protocol used for comparison of maps. The novel approach presented in this work is less sensitive to the number of points used in the analysis because graphs are constructed in a stepwise process in which the role of more distant neighbors has been diminished by linking a new spot to the nearest spot that has been already part of the neighborhood graph. In this way a graph with N + 1 spots is obtained from the graph on N spots by adding a single new link, while in the case of the nearest neighborhood graphs adding a new spot introduces novel neighborhoods and generally results in a graph that may differ significantly from the neighborhood graph on N points.