DocumentCode
545906
Title
Notice of Retraction
Similarity Analysis of DNA Sequences Based on LZ Complexity and Dynamic Programming Algorithm
Author
Xiaodong Guo ; Qi Dai ; Bin Han ; Lei Zhu ; Lihua Li
Author_Institution
Coll. of Life Inf. Sci. & Instrum. Eng., Hangzhou Dianzi Univ., Hangzhou, China
fYear
2011
fDate
10-12 May 2011
Firstpage
1
Lastpage
4
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
There are several algorithms to analyze similarity of DNA sequence, but it still remains a challenge. This paper presented a novel way to analyze DNA sequences, which was based on LZ complexity and dynamic programming algorithm. A DNA sequence can be broken into a word set with the LZ complexity. Motivated by the dynamic programming algorithm, we then analyze the similarity of DNA sequences by measuring shared information among their word-sets. Finally, the proposed method was tested by analyzing the similarity of the first exon of b-globin gene of eleven different species and compared its performance with the LZ complexity and multiple sequence alignment. The reasonable result verifies the validity of the proposed method.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
There are several algorithms to analyze similarity of DNA sequence, but it still remains a challenge. This paper presented a novel way to analyze DNA sequences, which was based on LZ complexity and dynamic programming algorithm. A DNA sequence can be broken into a word set with the LZ complexity. Motivated by the dynamic programming algorithm, we then analyze the similarity of DNA sequences by measuring shared information among their word-sets. Finally, the proposed method was tested by analyzing the similarity of the first exon of b-globin gene of eleven different species and compared its performance with the LZ complexity and multiple sequence alignment. The reasonable result verifies the validity of the proposed method.
Keywords
DNA; bioinformatics; dynamic programming; genetics; molecular biophysics; molecular configurations; DNA sequences; LZ complexity; b-globin gene; dynamic programming algorithm; exon; multiple sequence alignment; shared information; similarity analysis; word sets; Bioinformatics; Complexity theory; DNA; Dynamic programming; Heuristic algorithms; History; Phylogeny;
fLanguage
English
Publisher
ieee
Conference_Titel
Bioinformatics and Biomedical Engineering, (iCBBE) 2011 5th International Conference on
Conference_Location
Wuhan
ISSN
2151-7614
Print_ISBN
978-1-4244-5088-6
Type
conf
DOI
10.1109/icbbe.2011.5780038
Filename
5780038
Link To Document