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.
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.