Mining Protein Pathway from Proteomic Data

Finding protein pathways in protein interaction network is a computationally intricate and tough work. In this paper we approach this problem with double direction enumeration method combined with the distance constraints, which greatly increases the speed of the algorithm. The application of the method on the known yeast MAPK pathways verifies our algorithm. Paths with length 8 can be found in 5 minutes by our algorithm and other shorter paths less than 1 minute. Comparison with other methods highlights the efficiency of our work.