{"_buckets": {"deposit": "1d61c63d-4416-4719-a6e1-41b17fca83be"}, "_deposit": {"id": "2349", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "2349"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/2349", "sets": ["user-uy"]}, "communities": ["ccm", "ccp", "kyauksetu", "ltc", "maas", "miit", "mlmu", "mmu", "mtlu", "mtu", "mub", "mude", "mufl", "pathein", "scu", "suoe", "tcu", "tgu", "tuh", "tum", "ucsm", "ucsmtla", "ucsmub", "ucspathein", "ucstaungoo", "ucsy", "udmm", "udmy", "uit", "um", "um1", "um2", "umkn", "umm", "uphy", "urj", "uvs", "uy", "yau", "ydbu", "ytu", "yude", "yueco", "yufl", "yuoe"], "control_number": "2349", "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "AN EFFICIENT EXACT SOLUTION TO THE (L, D)-PLANTED MOTIF PROBLEM", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "DNA motif finding is widely recognized as a difficult problem in computational biology and computer science. Because of the usual large search space involved, exact solutions typically require a significant amount of execution time before discovering a motif of length d that occurs in each sequence Si from an input set {Sl, ...,Sf} of sequences, allowing for at most d substitutions.\r In this paper, we propose a novel algorithm that operates on a compact bit-based representation of the search space and takes advantage of distance-related patterns in this representation in order to compute the exact solution for any arbitrary problem instance up to l, d =6. \r A Java implementation-run on synthetic datasets for various challenge instances of the (l, d) motif finding problem-shows the proposed algorithm to be highly competitive against PMS8 and qPMS9, two current state-of the- art exact motif search algorithms. The proposed algorithm works extremely well for problems involving short motifs, outperforming the current best algorithm for the challenge problem instances (13,4) and (IS,S) with a runtime reduction of at least 50% and 20% respectively for these instances, while ranking second to qPMS9 for test instances involving l =16 and l =17."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "DNA motif finding"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-05-05"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "An Efficient exact solution to the (L, D)- planted MOTIF problem.pdf", "filesize": [{"value": "810 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 810000.0, "url": {"url": "https://meral.edu.mm/record/2349/files/An Efficient exact solution to the (L, D)- planted MOTIF problem.pdf"}, "version_id": "06de3ce0-fcd0-4de4-8f27-5475a2b0dcad"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_journal_title": "8th AUN/SEED-Net Regional Conference on Electrical and Electronics Engineering"}]}, "item_1583103147082": {"attribute_name": "Conference papaers", "attribute_value_mlt": [{}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_supervisor(s)": []}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Sia, Maria Clara Isabel D."}, {"subitem_authors_fullname": "Nabos, Julieta Q."}, {"subitem_authors_fullname": "Fernandez, Proceso L."}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Other"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Other"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2015"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "https://uyr.uy.edu.mm/handle/123456789/368"}, "item_title": "AN EFFICIENT EXACT SOLUTION TO THE (L, D)-PLANTED MOTIF PROBLEM", "item_type_id": "21", "owner": "1", "path": ["1582967549708"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000002349", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-03-05"}, "publish_date": "2020-03-05", "publish_status": "0", "recid": "2349", "relation": {}, "relation_version_is_last": true, "title": ["AN EFFICIENT EXACT SOLUTION TO THE (L, D)-PLANTED MOTIF PROBLEM"], "weko_shared_id": -1}