題目：Algorithms of text complexity estimates for analysis of mutation sites in genomes

　　報告人：Yuriy L. Orlov

　　時間：2023年3月10日（周五）,，下午14：30-15：30

　　會議地點：31-904

　　報告摘要：

　　The analysis of DNA sequences demand development of new mathematical and computer methods of the theory of information transmission and data compression. Previously we have developed algorithms for estimating DNA text complexity, including linguistic complexity, the Lempel-Ziv algorithm and Shannon entropy estimates. All the measures calculated have normalized values from 0 to 1 to be directly compared. A huge amount of experimental data on DNA sequences, accumulated in specialized databases, makes it possible to obtain qualitatively new knowledge about the structure and evolution of genomes. The text complexity estimation algorithm provides a tool for quality control in next generation sequencing data. A decrease in text complexity values （including Shannon entropy and linguistic complexity estimates） was previously shown in DNA regions containing regions of single nucleotide polymorphisms. The change in the complexity of the DNA text on average （in a sliding window） for samples of nucleotide sequences containing clusters of transcription factor binding sites is also shown.

　　報告人簡介：

　　Yuriy L. Orlov,，博士,，科學(xué)博士，俄羅斯科學(xué)院教授,，現(xiàn)任莫斯科國立謝東諾夫第一醫(yī)科大學(xué)（謝東諾夫大學(xué)）數(shù)字醫(yī)學(xué)研究所信息和互聯(lián)網(wǎng)技術(shù)chair professor,。其他任職單位：俄羅斯新西伯利亞州立大學(xué)生命科學(xué)系和新西伯利亞細(xì)胞和遺傳學(xué)研究所（俄羅斯科學(xué)院西伯利亞分院）；俄羅斯符拉迪沃斯托克遠(yuǎn)東聯(lián)邦大學(xué)生物醫(yī)學(xué)學(xué)院,；俄羅斯人民友誼大學(xué)（RUDN）農(nóng)業(yè)技術(shù)研究所,。