LZ Complexity Distance of DNA Sequences and Its Application in Phylogenetic Tree Reconstruction

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Li, Bin, Li, Yi-Bing, He, Hong-Bo
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2005
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5172548/
https://www.ncbi.nlm.nih.gov/pubmed/16689687
http://dx.doi.org/10.1016/S1672-0229(05)03028-7

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5172548/
https://www.ncbi.nlm.nih.gov/pubmed/16689687
http://dx.doi.org/10.1016/S1672-0229(05)03028-7

Ejemplares similares