UCSY's Research Repository

Sequential Patterns Mining For DNA Sequences Based On Divided and Conquers Approach

Show simple item record

dc.contributor.author Htein, Aung Thet
dc.date.accessioned 2019-08-19T06:35:23Z
dc.date.available 2019-08-19T06:35:23Z
dc.date.issued 2009-08-03
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/2136
dc.description.abstract Data mining is process of pattern extraction from a large collection of datasets.Main goal of data mining is to discover the frequent itemsets(patterns).Sequential pattern mining is an important data mining problem that generates a combinatorial explosive number of intermediate subsequences.Sequential pattern mining generates patterns based on item occurrence order.PrefixlSpan is one of the fast sequential pattern mining algorithms based on divide and conquer approach.PrefixSpan algorithm partitons databases based on currently identified frequent patterns and grow to longer ones using projected databases.This paper presented mining DNA sequential patterns based on divide and conquers approach.Divide and conquer strategy process is partitioning method.By using PrefixSpan method,projected databases are processed in parallel,therefore processing time can be reduced and it will support the bioinformatics field. en_US
dc.language.iso en en_US
dc.publisher Third Local Conference on Parallel and Soft Computing en_US
dc.title Sequential Patterns Mining For DNA Sequences Based On Divided and Conquers Approach en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account

Statistics