Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/395126
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMohammed Omer Haj Assayony-
dc.contributor.authorNur' Aini Abdul Rashid-
dc.date.accessioned2023-06-15T07:55:36Z-
dc.date.available2023-06-15T07:55:36Z-
dc.identifier.otherukmvital:122989-
dc.identifier.urihttps://ptsldigital.ukm.my/jspui/handle/123456789/395126-
dc.description.abstractClustering 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 sub-graph 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 graph-based proposed a parallel approach in 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.-
dc.language.isoeng-
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE),Piscataway, US-
dc.subjectProtein sequence-
dc.subjectClustering algorithm-
dc.titleDesign of parallel graph-based protein sequence clustering algorithm-
dc.typeSeminar Papers-
dc.format.pages7-
dc.identifier.callnoT58.5.C634 2008 kat sem j.3-
dc.contributor.conferencenameInternational Symposium on Information Technology-
dc.coverage.conferencelocationKuala Lumpur Convention Centre-
dc.date.conferencedate26/08/2008-
Appears in Collections:Seminar Papers/ Proceedings / Kertas Kerja Seminar/ Prosiding

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.