A relative Lempel–Ziv complexity: Application to comparing biological sequences
[Display omitted] ► The main advantage is that this method can extract repeated patterns from biological sequence. ► The time complexity of this algorithm is O(l(Q)×l(R)). ► We use this method to build phylogenetic tree. The result demonstrate that our method is powerful and efficient. One of the ma...
Saved in:
Published in | Chemical physics letters Vol. 530; pp. 107 - 112 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Netherlands
Elsevier B.V
19.03.2012
|
Online Access | Get full text |
Cover
Loading…
Summary: | [Display omitted]
► The main advantage is that this method can extract repeated patterns from biological sequence. ► The time complexity of this algorithm is O(l(Q)×l(R)). ► We use this method to build phylogenetic tree. The result demonstrate that our method is powerful and efficient.
One of the main tasks in biological sequence analysis is biological sequence comparison. Numerous efficient methods have been developed for sequence comparison. Traditional sequence comparison is based on sequence alignment. In this report, we propose a novel alignment-free method based on the relative Lempel–Ziv complexity to compare biological sequences. The vertebrate transferring genomes and the spike protein sequences are prepared and tested to evaluate the validity of the method. We use this method to build phylogenetic tree of two groups of the sequences. The result demonstrates that our method is powerful and efficient. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 0009-2614 1873-4448 0009-2614 |
DOI: | 10.1016/j.cplett.2012.01.061 |