河南大学数据分析技术实验室

设为首页  |  加入收藏

 首页  研究中心概况  新闻动态  研究队伍  科研成果  合作交流  人才培养  下载中心 
新闻动态

河南大学数学与统计学院在第七届 06-19
Empirical likelihood in single 05-13
现代人工智能的本质、途径和方向 04-13
热烈祝贺武相军教授荣登“爱思唯 03-28
数学与统计学院优秀毕业生分享交 03-24
(开启)人工智能理论及算法—应用 03-24
河南大学数学与统计学院“人工智 03-20
Limit Theory for the Autoregre 12-13
Learning without Paired Data i 12-08
Mathematical Modeling for Biom 12-08

新闻动态
您的位置: 首页>>新闻动态>>正文

Scaffolding Algorithm Based on Short Reads or Long Reads
2020-09-21 18:56  

报告题目:Scaffolding Algorithm Based on Short Reads or Long Reads

主讲人:罗 军 伟

单 位:河南理工大学

时 间:9月22日19:00

腾 讯 ID:815 277 628

摘 要:

In the field of genome assembly, through scaffolding algorithms, a more complete and contiguous reference genome can be obtained, which is the cornerstone of genomic research. Scaffolding algorithms typically utilize the alignments between contigs and sequencing data (reads) to determine the orientation and order among contigs and to produce longer scaffolds, which are helpful for genomic downstream analysis.We present a novel scaffolding algorithm (called BOSS), which employs short paired reads for scaffolding. To construct a scaffold graph, BOSS utilizes the distribution of insert size to decide whether an edge between two vertices (contigs) should be added and how an edge should be weighed. Moreover, BOSS adopts an iterative strategy to detect spurious edges whose removal can guarantee no contradictions in the scaffold graph. We also present a scaffolding algorithm based on long reads and contig classification (SLR). SLR classifies the contigs into unique contigs and ambiguous contigs for addressing the problem of repetitive regions.

简 介:

罗军伟,博士,副教授,博士生导师。近年来主要从事机器学习、深度学习、大数据技术应用、生物信息等方面的研究。目前,主持国家自然科学基金面上项目1项和省级项目1项、主持完成国家自然科学青年基金1项、作为主要人员参与完成国家自然科学基金项目4项、参与完成省部级科研项目4项,获得河南省自然科学二等奖1项。在国际重要期刊《Bioinformatics》、《IEEE/ACM Transactions on Computational Biology and Bioinformatics》、《BMC Bioinformatics》以及国际重要学术会议BIBM、ISBRA等上发表学术论文20余篇。获得ACM SIGBIO优秀博士论文奖、河南省青年骨干教师等荣誉。

关闭窗口