首页 | 本学科首页   官方微博 | 高级检索  
   检索      


LZ complexity distance of DNA sequences and its application in phylogenetic tree reconstruction
Authors:Li Bin  Li Yi Bing  He Hong Bo
Institution:School of Information Science and Engineering, Central South University, Changsha 410083, China. li_bin@126.com
Abstract: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.
Keywords:bioinformatics  sequence complexity  conditional LZ complexity  LZ complexity distance  phylogenetic tree reconstruction
本文献已被 维普 万方数据 PubMed 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号