摘要
DNAsequencescanbetreatedasfinite-lengthsymbolstringsoverafour-letteralphabet(A,C,T,G).Asauniversalandcomputablecomplexitymeasure,LZcomplexityisvalidtodescribethecomplexityofDNAsequences.Inthisstudy,aconceptofconditionalLZcomplexitybetweentwosequencesisproposedaccordingtotheprincipleofLZcomplexitymeasure.AnLZcomplexitydistancemetricbetweentwononnullsequencesisdefinedbyutilizingconditionalLZcomplexity.BasedonLZcomplexitydistance,aphylogenetictreeof26speciesofplacentalmammals(Eutheria)withthreeoutgroupspecieswasreconstructedfromtheircompletemitochondrialgenomes.Onthedebatethatwhichtwoofthethreemaingroupsofplacentalmammals,namelyPrimates,Ferungulates,andRodents,aremorecloselyrelated,thephylogenetictreereconstructedbasedonLZcomplexitydistancesupportsthesuggestionthatPrimatesandFerungulatesaremorecloselyrelated.
出版日期
2005年04月14日（中国期刊网平台首次上网日期，不代表论文的发表时间）
