Construction of DNA Codes From Composite Matrices and a Bio-Inspired Optimization Algorithm
dc.authorid | https://orcid.org/0000-0001-5206-6480 | en_US |
dc.authorid | https://orcid.org/0000-0002-2084-6260 | en_US |
dc.authorid | https://orcid.org/0000-0002-5229-4018 | en_US |
dc.authorscopusid | 26325279300 | en_US |
dc.authorscopusid | 57206665622 | en_US |
dc.authorscopusid | 55420759300 | en_US |
dc.authorscopusid | 36728602600 | en_US |
dc.authorwosid | COV-5724-2022 | en_US |
dc.authorwosid | DWJ-0396-2022 | en_US |
dc.authorwosid | ABB-4228-2020 | en_US |
dc.authorwosid | GQB-3301-2022 | en_US |
dc.contributor.author | Korban, Adrian | |
dc.contributor.author | Şahinkaya, Serap | |
dc.contributor.author | Üstün, Deniz | |
dc.contributor.author | Dougherty, S. T. | |
dc.date.accessioned | 2023-08-29T09:34:44Z | |
dc.date.available | 2023-08-29T09:34:44Z | |
dc.date.issued | 2023 | en_US |
dc.department | Fakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.description.abstract | Indexed keywords SciVal Topics Metrics Funding details Abstract In this work, we present a new construction method for reversible codes. We employ composite matrices derived from group rings and show how to construct these matrices so that they are also reversible. Also in this work, we give an algorithm for calculating conflict free DNA codes that satisfy the Hamming distance, the reverse, the reverse-complement, the GC-content constraints with each DNA codeword being free from reverse complement sub-strings. By employing our construction method for reversible codes and our algorithm, we construct a number of DNA codes that satisfy the above constraints. Many of the codes we obtain have better parameters than some known DNA codes and many have parameters that are new to the literature. | en_US |
dc.identifier.citation | Dougherty, S.T., Korban, A. Sahinkaya, S. ve Ustun, D. (2023). Construction of DNA Codes From Composite Matrices and a Bio-Inspired Optimization Algorithm. IEEE Transactions on Information Theory, 69,3, 1588-1603. doi: 10.1109/TIT.2022.3217518. | en_US |
dc.identifier.doi | 10.1109/TIT.2022.3217518 | en_US |
dc.identifier.endpage | 1603 | en_US |
dc.identifier.issn | 0018-9448 | |
dc.identifier.issn | 1557-9654 | |
dc.identifier.issue | 3 | en_US |
dc.identifier.scopus | 2-s2.0-85141528606 | en_US |
dc.identifier.startpage | 1588 | en_US |
dc.identifier.uri | 10.1109/TIT.2022.3217518 | |
dc.identifier.uri | https://hdl.handle.net/20.500.13099/173 | |
dc.identifier.volume | 69 | en_US |
dc.identifier.wos | WOS:000966393600001 | en_US |
dc.identifier.wosquality | Q3 | en_US |
dc.institutionauthor | Şahinkaya, Serap | |
dc.institutionauthor | Üstün, Deniz | |
dc.language.iso | eng | en_US |
dc.publisher | IEEE-INST Electrical Electronics Engineers Inc. | en_US |
dc.relation.ispartof | IEEE Transactions on Information Theory | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/restrictedAccess | en_US |
dc.subject | composite matrices | en_US |
dc.subject | conflict free DNA codes | en_US |
dc.subject | DNA codes | en_US |
dc.subject | group rings | en_US |
dc.subject | Bioinformatics | en_US |
dc.subject | Biomimetics | en_US |
dc.subject | Codes (symbols) | en_US |
dc.subject | DNA | en_US |
dc.subject | DNA sequences | en_US |
dc.subject | Gene encoding | en_US |
dc.subject | Bio-inspired optimizations | en_US |
dc.subject | Composite matrices | en_US |
dc.subject | Conflict free | en_US |
dc.subject | Conflict free DNA code | en_US |
dc.subject | Construction method | en_US |
dc.subject | DNA codes | en_US |
dc.subject | Group rings | en_US |
dc.subject | Optimization algorithms | en_US |
dc.subject | Reversible codes | en_US |
dc.subject | Hamming distance | en_US |
dc.title | Construction of DNA Codes From Composite Matrices and a Bio-Inspired Optimization Algorithm | en_US |
dc.type | article | en_US |