Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
New approximation techniques for some ordering problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A polynomial time recognition algorithm for probe interval graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimal linear arrangement of interval graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
The availability of large-scale protein-protein interaction data provides us with many opportunities to study molecular pathways involving proteins. In this paper we propose to mine temporal relations in molecular pathways by protein-protein interaction data. In particular, we model the assembly pathways of protein complexes with interval graphs and determine the temporal order of joining the pathway for proteins by ordering the vertices in the interaction graph. We develop a tool called Xronos to perform such a computation. We then apply Xronos to the ribosome assembly pathway and present validation results for the obtained ordering. The results are promising and show the potential usage for Xronos in the study of molecular pathways.