DocumentCode :
476822
Title :
Design of a parallel graph-based protein sequence clustering algorithm
Author :
Assayony, Mohammed Omer Haj ; Rashid, Nur´ Aini Abdul
Author_Institution :
Sch. of Comput. Sci., Univ. Sains Malaysia, Nibong Tebal
Volume :
3
fYear :
2008
fDate :
26-28 Aug. 2008
Firstpage :
1
Lastpage :
8
Abstract :
Clustering protein sequences is becoming important in helping biologists analyze the large protein sequences produced by wet lab experiments. Graph based partitioning methods which is an important and stable algorithm in computer science can be used to cluster protein sequences such that each identified subgraph can be considered as a cluster. Each cluster represents a family of protein sequences or protein sequences that shared a common attribute. Since the size of protein sequence databases increases 1.5 times yearly, a fast and efficient graph based protein sequence clustering method is much needed. We proposed a parallel approach in graph-based clustering methods by improving the performance of an existing algorithm ProtClust by using parallel methods. We presented the design of a parallel method which will be the basis of our experiments for protein sequence clustering.
Keywords :
biology computing; graph theory; parallel algorithms; pattern clustering; proteins; graph-based partitioning method; parallel graph-based protein sequence clustering algorithm; protein sequence database; wet lab experiment; Algorithm design and analysis; Bioinformatics; Clustering algorithms; Concurrent computing; Databases; Genomics; Graph theory; Partitioning algorithms; Protein engineering; Protein sequence;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology, 2008. ITSim 2008. International Symposium on
Conference_Location :
Kuala Lumpur
Print_ISBN :
978-1-4244-2327-9
Electronic_ISBN :
978-1-4244-2328-6
Type :
conf
DOI :
10.1109/ITSIM.2008.4632057
Filename :
4632057
Link To Document :
بازگشت