2023年信息工程学院学术报告之五

　　题目：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，博士，科学博士，俄罗斯科学院教授，现任莫斯科国立谢东诺夫第一医科大学（谢东诺夫大学）数字医学研究所信息和互联网技术chair professor。其他任职单位：俄罗斯新西伯利亚州立大学生命科学系和新西伯利亚细胞和遗传学研究所（俄罗斯科学院西伯利亚分院）；俄罗斯符拉迪沃斯托克远东联邦大学生物医学学院；俄罗斯人民友谊大学（RUDN）农业技术研究所。