Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/58598
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hai Q. Dinh | en_US |
dc.contributor.author | Abhay Kumar Singh | en_US |
dc.contributor.author | Sukhamoy Pattanayak | en_US |
dc.contributor.author | Songsak Sriboonchitta | en_US |
dc.date.accessioned | 2018-09-05T04:26:39Z | - |
dc.date.available | 2018-09-05T04:26:39Z | - |
dc.date.issued | 2018-01-01 | en_US |
dc.identifier.issn | 03043975 | en_US |
dc.identifier.other | 2-s2.0-85051092264 | en_US |
dc.identifier.other | 10.1016/j.tcs.2018.06.002 | en_US |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85051092264&origin=inward | en_US |
dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/58598 | - |
dc.description.abstract | © 2018 Elsevier B.V. We develop the theory for constructing DNA cyclic codes of odd length over R=Z4[u]/〈u2−1〉 based on the deletion distance. Cyclic codes of odd length over R satisfying the reverse constraint and the reverse-complement constraint are discussed. The GC-content of these codes and their deletion distance are studied. Among others, examples of cyclic DNA codes with GC-content and their respective deletion distance are provided. | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Mathematics | en_US |
dc.title | Construction of cyclic DNA codes over the ring Z<inf>4</inf>[u]/〈u<sup>2</sup>−1〉 based on the deletion distance | en_US |
dc.type | Journal | en_US |
article.title.sourcetitle | Theoretical Computer Science | en_US |
article.stream.affiliations | Ton-Duc-Thang University | en_US |
article.stream.affiliations | Kent State University | en_US |
article.stream.affiliations | Indian Institute of Technology (Indian School of Mines), Dhanbad | en_US |
article.stream.affiliations | Chiang Mai University | en_US |
Appears in Collections: | CMUL: Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.