The workflow of GOExtender. First, candidate parent terms T are selected. Second, an edge based matrix M is generated using biological network G and T. Third, all the connected maximal submatrices of M are identified and are saved in M_c. Finally, new GO terms are predicted from M_c by adopting a graph clustering algorithm