{"created":"2020-09-01T13:52:34.847963+00:00","id":3996,"links":{},"metadata":{"_buckets":{"deposit":"8c2bf228-7cfd-4c11-93cd-07d6c28ad514"},"_deposit":{"id":"3996","owners":[],"pid":{"revision_id":0,"type":"recid","value":"3996"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/3996","sets":["1582963302567:1597824273898"]},"communities":["ucsy"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Parallel Implementation of Smith Waterman Sequence Alignment Algorithm","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"Local sequence alignment is widely used todiscover structural and hence, functionalsimilarities between biological sequences. Sequencedatabase alignment is among the most importantand challenging tasks in bioinformatics. This paperpresents a parallel algorithm that finds alloccurrences of a pattern string in a subject string inO(log n) time, where n is the length of the subjectstring. The number of processors employed is of theorder of the product of the two string lengths. It alsopresents advanced computer architectures thatutilize parallelism via multiple processing units.While parallel computing, in the form of internallylinked processors, was the main form of parallelism,advances in computer networks has created a newtype of parallelism in the form of networkedautonomous computers. . The right choice ofsequence alignment algorithm is that of Smith-Waterman. To get high quality results in a shorttime is to use parallel processing."}]},"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-04"}],"displaytype":"preview","filename":"55104.pdf","filesize":[{"value":"386 Kb"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://meral.edu.mm/record/3996/files/55104.pdf"},"version_id":"3119d030-f321-440e-9c63-e987e97d604f"}]},"item_1583103131163":{"attribute_name":"Journal articles","attribute_value_mlt":[{"subitem_issue":"","subitem_journal_title":"Fourth 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":"Nyunt, Han Su Yin"},{"subitem_authors_fullname":"Naing, Thinn"}]}]},"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-12-30"},"item_1583159847033":{"attribute_name":"Identifier","attribute_value":"http://onlineresource.ucsy.edu.mm/handle/123456789/1709"},"item_title":"Parallel Implementation of Smith Waterman Sequence Alignment Algorithm","item_type_id":"21","owner":"1","path":["1597824273898"],"publish_date":"2019-08-04","publish_status":"0","recid":"3996","relation_version_is_last":true,"title":["Parallel Implementation of Smith Waterman Sequence Alignment Algorithm"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2021-12-13T00:42:01.572435+00:00"}