ECPF: an efficient algorithm for expanding clustered protein families
by Zhongyang Zuo; Yanheng Liu; Liyan Zhao; Li Xu; Jian Wang; Xiaoyan Lv
International Journal of Data Mining and Bioinformatics (IJDMB), Vol. 16, No. 4, 2016

Abstract: With the quick development of gene sequencing technology, the explosion age marked by protein sequences has already come. How to deal with a huge number of protein sequences has aroused serious concern in the research field. An effective solution is to cluster homologous sequences into separated protein families. Those proteins that are affiliated to the same protein family share the similar structure and/or the functionality of genes. The known proteins will facilitate to identify various valuable evidences for discovering the unknown proteins. We present an efficient and effective algorithm called Expanding Clustered Protein Families (ECPF), which could skilfully optimise the clustered protein sequences. The results show that ECPF is capable of discovering the unknown connections between storing space and families in large-scale databases while consuming acceptable overhead of computational time. ECPF successfully expands the protein sequence network and furthermore creates a more practical protein sequence topology for promoting biological research.

Online publication date: Sun, 12-Feb-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining and Bioinformatics (IJDMB):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com