Protein-protein interaction and group testing in bipartite graphs

Authors:
Yingshu Li;My T. Thai;Zhen Liu;Weili Wu
Affiliations:
Department of Computer Science, Georgia State University, 34 Peachtree Street, Atlanta, GA 30303, USA.;Department of Computer Science, University of Minnesota, Twin Cities, 200 Union Street S.E., Minneapolis, MN 55455, USA.;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA.;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA
Venue:
International Journal of Bioinformatics Research and Applications
Year:
2005

Citing 3
Cited 1

A group testing problem for hypergraphs of bounded rank

Discrete Applied Mathematics
Group Testing Problems with Sequences in Experimental Molecular Biology

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
On error-tolerant DNA screening

Discrete Applied Mathematics

Decoding algorithms in pooling designs with inhibitors and error-tolerance

International Journal of Bioinformatics Research and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The interactions between bait proteins and prey proteins are often critical in many biological processes, such as the formation of macromolecular complexes and the transduction of signals in biological pathways. Thus, identifying all protein-protein interactions is an important task in those processes, which can be formulated as a group testing problem in bipartite graphs. In this paper, we take the advantages of the characteristics of bipartite graphs and present two nonadaptive algorithms for this problem. Furthermore, we illustrate a generalisation of our solution in a more general case.