期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
LZ Complexity Distance of DNA Sequences and Its Application in Phylogenetic Tree Reconstruction 被引量:4
1
作者 Bin Li Yi-Bing Li Hong-Bo He 《Genomics, Proteomics & Bioinformatics》 SCIE CAS CSCD 2005年第4期206-212,共7页
DNA sequences can be treated as finite-length symbol strings over a four-letter alphabet (A, C, T, G). As a universal and computable complexity measure, LZ complexity is valid to describe the complexity of DNA seque... DNA sequences can be treated as finite-length symbol strings over a four-letter alphabet (A, C, T, G). As a universal and computable complexity measure, LZ complexity is valid to describe the complexity of DNA sequences. In this study, a concept of conditional LZ complexity between two sequences is proposed according to the principle of LZ complexity measure. An LZ complexity distance metric between two nonnull sequences is defined by utilizing conditional LZ complexity. Based on LZ complexity distance, a phylogenetic tree of 26 species of placental mammals (Eutheria) with three outgroup species was reconstructed from their complete mitochondrial genomes. On the debate that which two of the three main groups of placental mammals, namely Primates, Ferungulates, and Rodents, are more closely related, the phylogenetic tree reconstructed based on LZ complexity distance supports the suggestion that Primates and Ferungulates are more closely related. 展开更多
关键词 BIOINFORMATICS sequence complexity conditional LZ complexity LZ complexity distance phylogenetic tree reconstruction
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部