{"created":"2020-09-01T14:27:49.972734+00:00","id":4280,"links":{},"metadata":{"_buckets":{"deposit":"0938ab38-3e2c-48a7-9e79-80e744343cd3"},"_deposit":{"id":"4280","owners":[],"pid":{"revision_id":0,"type":"recid","value":"4280"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/4280","sets":["1582963302567:1597824273898"]},"communities":["ucsy"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Sequential Patterns Mining For DNA Sequences Based On Divided and Conquers Approach","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"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."}]},"item_1583103108160":{"attribute_name":"Keywords","attribute_value":[]},"item_1583103120197":{"attribute_name":"Files","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2019-08-19"}],"displaytype":"preview","filename":"Sequential Patterns Mining For DNA Sequences Based On Divided and Conquers Approach.pdf","filesize":[{"value":"6 Kb"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://meral.edu.mm/record/4280/files/Sequential Patterns Mining For DNA Sequences Based On Divided and Conquers Approach.pdf"},"version_id":"2be9caca-5f79-4ea3-874d-76322b240cd8"}]},"item_1583103131163":{"attribute_name":"Journal articles","attribute_value_mlt":[{"subitem_issue":"","subitem_journal_title":"Third Local Conference on Parallel and Soft Computing","subitem_pages":"","subitem_volume":""}]},"item_1583103147082":{"attribute_name":"Conference papers","attribute_value_mlt":[{"subitem_acronym":"","subitem_c_date":"","subitem_conference_title":"","subitem_part":"","subitem_place":"","subitem_session":"","subitem_website":""}]},"item_1583103211336":{"attribute_name":"Books/reports/chapters","attribute_value_mlt":[{"subitem_book_title":"","subitem_isbn":"","subitem_pages":"","subitem_place":"","subitem_publisher":""}]},"item_1583103233624":{"attribute_name":"Thesis/dissertations","attribute_value_mlt":[{"subitem_awarding_university":"","subitem_supervisor(s)":[{"subitem_supervisor":""}]}]},"item_1583105942107":{"attribute_name":"Authors","attribute_value_mlt":[{"subitem_authors":[{"subitem_authors_fullname":"Htein, Aung Thet"}]}]},"item_1583108359239":{"attribute_name":"Upload type","attribute_value_mlt":[{"interim":"Publication"}]},"item_1583108428133":{"attribute_name":"Publication type","attribute_value_mlt":[{"interim":"Article"}]},"item_1583159729339":{"attribute_name":"Publication date","attribute_value":"2009-08-03"},"item_1583159847033":{"attribute_name":"Identifier","attribute_value":"http://onlineresource.ucsy.edu.mm/handle/123456789/2136"},"item_title":"Sequential Patterns Mining For DNA Sequences Based On Divided and Conquers Approach","item_type_id":"21","owner":"1","path":["1597824273898"],"publish_date":"2019-08-19","publish_status":"0","recid":"4280","relation_version_is_last":true,"title":["Sequential Patterns Mining For DNA Sequences Based On Divided and Conquers Approach"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2021-12-13T06:17:00.436975+00:00"}