| Login
dc.contributor.author | Shawon, Solaiman | |
dc.contributor.author | Emon, Abir Mahmud | |
dc.date.accessioned | 2021-09-09T09:34:58Z | |
dc.date.available | 2021-09-09T09:34:58Z | |
dc.date.issued | 2013-11-15 | |
dc.identifier.citation | 1. Gagneur,J. et al. (2004) Modular decomposition of protein-protein interaction networks. Genome Biol., 5, R57. 2. Del Mondo,G.; Eveillard,D.; Rusu,I. et al. (2009) Homogeneous decomposition of protein interaction networks:re ning the description of intra-modular interactions. Bioinformatics, 25, 926932. 3. Cannataro,M; H. Guzzi,P; Veltri,P. et al. (2010) Protein-to-Protein Interactions: Technologies, Databases, and Algorithms. ACM Computing Surveys, 43, 1. 4. Ma,X; Gao,L. et al. (2012) Discovering protein complexes in protein interaction networks via exploring the weak ties e ect. BMC Systems Biology, 6:S6. 5. Spirin,V. and Mirny,L.A. (2003) Protein complexes and functional modules in molecular networks. Proc. Natl Acad. Sci. USA, 100, 12123 12128. 6. Hollunder,J.; Beyer, A.; Wilhelm,T. et al. (2007) Protein Subcomplexes- Molecular Machines With Highly Specialized Functions. IEEE Transactions on Nanobioscience, 6, 1. 7. Barabsi,A.; Gulbahce,N.; Loscalzo, J. et al. (2011) Network medicine: a network-based approach to human disease. NatureRev, v-12. 22 Chapter 6. References 23 8. Bader, G. and Hogue, C. et al. (2003) An automated method for nding molecular complexes in large protein interaction networks. BMC Bioinformatics, 4, 1, 2. | en_US |
dc.identifier.uri | http://hdl.handle.net/123456789/930 | |
dc.description | Supervised by: Tareque Mohmud Chowdhury Assistant Professor, Department of Computer Science and Engineering (CSE) Islamic University of Technology (IUT), Board Bazar, Gazipur-1704, Bangladesh. | en_US |
dc.description.abstract | Detecting protein complexes from protein-protein interaction (PPI) network is becoming a di cult challenge in computational biology.In the post-genome era, databases of protein-protein interactions are growing too fast that many well estab- lished algorithms can not perform well in analyzing these.New forms of interaction datasets are increasingly being found where many of well known alorithms can not be applied. Identifying protein complexes and the way they share components appears as an essential step in describing cellular biology on a molecular basis.Graph Theoretic approaches are very popular in predicting protein complexes as they give a good insight into protein interaction networks in terms of connectivity and neighbor- hood.A novel graph decomposition method named Homogeneous Decomposition is very well performing in predicting protein complexes.It not only shows the mem- bers of the complexes but also can describe the relations between them.But it can not go further in some kind of networks with di erent scenario.We intend to in- vestigate these limitations and propose new descriptions re ning the current ones to overcome the limitations. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Department of Computer Science and Engineering (CSE), Islamic University of Technology (IUT), Board Bazar, Gazipur-1704, Bangladesh | en_US |
dc.title | Finding protein complexes in protein Interaction networks: an extension of Homogeneous decomposition method | en_US |
dc.type | Thesis | en_US |