Genome Polymorphism Detection Through Relaxed de Bruijn Graph Construction

2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE)(2017)

引用 0|浏览24
暂无评分
摘要
Comparing genomes to identify polymorphisms is a difficult task, especially beyond single nucleotide poly-morphisms. Polymorphism detection is important in disease association studies as well as in phylogenetic tree reconstruc-tion. We present a method for identifying polymorphisms in genomes by using a modified version de Bruijn graphs, data structures widely used in genome assembly from Next-Generation Sequencing. Using our method, we are able to identify polymorphisms that exist within a genome as well as well as see graph structures that form in the de Bruijn graph for particular types of polymorphisms (translocations, etc.)
更多
查看译文
关键词
de Bruijn graph,graph,GWAS,phylogenetics,polymorphism
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要