Similarity cyclic DNA codes over rings

Irfan Siap; Taher Abualrub; Ali Ghrayeb

doi:10.1109/ICBBE.2008.149

Similarity cyclic DNA codes over rings

Irfan Siap^*, Taher Abualrub, Ali Ghrayeb

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Citations (Scopus)

Abstract

In this paper we construct a special type of cyclic codes called cyclic DNA codes over the ring R = {0, 1, u, u + 1} where u² = 1. These codes are important in the subject of biomolecular computation and DNA computing.We apply a more suitable measure (the similarity measure) than the Hamming distance measure on the set of codewords. Our similarity measure depends on the number of hydrogen bonds between Watson Crick complement pairs.

Original language	English
Title of host publication	2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008
Publisher	IEEE Computer Society
Pages	612-615
Number of pages	4
ISBN (Print)	9781424417483
DOIs	https://doi.org/10.1109/ICBBE.2008.149
Publication status	Published - 2008
Externally published	Yes
Event	2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008 - Shanghai, China Duration: 16 May 2008 → 18 May 2008

Publication series

Name	2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008

Conference

Conference	2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008
Country/Territory	China
City	Shanghai
Period	16/05/08 → 18/05/08

Access to Document

10.1109/ICBBE.2008.149

Cite this

@inproceedings{5fd647c818184914b8aea61708aa12de,

title = "Similarity cyclic DNA codes over rings",

abstract = "In this paper we construct a special type of cyclic codes called cyclic DNA codes over the ring R = {0, 1, u, u + 1} where u2 = 1. These codes are important in the subject of biomolecular computation and DNA computing.We apply a more suitable measure (the similarity measure) than the Hamming distance measure on the set of codewords. Our similarity measure depends on the number of hydrogen bonds between Watson Crick complement pairs.",

author = "Irfan Siap and Taher Abualrub and Ali Ghrayeb",

year = "2008",

doi = "10.1109/ICBBE.2008.149",

language = "English",

isbn = "9781424417483",

series = "2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008",

publisher = "IEEE Computer Society",

pages = "612--615",

booktitle = "2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008",

address = "United States",

note = "2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008 ; Conference date: 16-05-2008 Through 18-05-2008",

}

Siap, I, Abualrub, T & Ghrayeb, A 2008, Similarity cyclic DNA codes over rings. in 2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008., 4535029, 2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008, IEEE Computer Society, pp. 612-615, 2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008, Shanghai, China, 16/05/08. https://doi.org/10.1109/ICBBE.2008.149

Similarity cyclic DNA codes over rings. / Siap, Irfan; Abualrub, Taher; Ghrayeb, Ali.
2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008. IEEE Computer Society, 2008. p. 612-615 4535029 (2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Similarity cyclic DNA codes over rings

AU - Siap, Irfan

AU - Abualrub, Taher

AU - Ghrayeb, Ali

PY - 2008

Y1 - 2008

N2 - In this paper we construct a special type of cyclic codes called cyclic DNA codes over the ring R = {0, 1, u, u + 1} where u2 = 1. These codes are important in the subject of biomolecular computation and DNA computing.We apply a more suitable measure (the similarity measure) than the Hamming distance measure on the set of codewords. Our similarity measure depends on the number of hydrogen bonds between Watson Crick complement pairs.

AB - In this paper we construct a special type of cyclic codes called cyclic DNA codes over the ring R = {0, 1, u, u + 1} where u2 = 1. These codes are important in the subject of biomolecular computation and DNA computing.We apply a more suitable measure (the similarity measure) than the Hamming distance measure on the set of codewords. Our similarity measure depends on the number of hydrogen bonds between Watson Crick complement pairs.

UR - http://www.scopus.com/inward/record.url?scp=50949122428&partnerID=8YFLogxK

U2 - 10.1109/ICBBE.2008.149

DO - 10.1109/ICBBE.2008.149

M3 - Conference contribution

AN - SCOPUS:50949122428

SN - 9781424417483

T3 - 2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008

SP - 612

EP - 615

BT - 2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008

PB - IEEE Computer Society

T2 - 2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008

Y2 - 16 May 2008 through 18 May 2008

ER -

Similarity cyclic DNA codes over rings

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this