Caricamento...
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...
Salvato in:
| Pubblicato in: | Genomics Proteomics Bioinformatics |
|---|---|
| Autori principali: | , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Elsevier
2005
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5172548/ https://ncbi.nlm.nih.gov/pubmed/16689687 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/S1672-0229(05)03028-7 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|