Title
Genome Polymorphism Detection Through Relaxed de Bruijn Graph Construction
Abstract
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.)
Year
DOI
Venue
2017
10.1109/BIBE.2017.00-53
2017 IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE)
Keywords
Field
DocType
de Bruijn graph,graph,GWAS,phylogenetics,polymorphism
Genome,Phylogenetic tree,Computer science,Genome-wide association study,Genomics,De Bruijn graph,Artificial intelligence,Computational biology,De Bruijn sequence,Phylogenetics,Machine learning,Sequence assembly
Conference
ISSN
ISBN
Citations 
2471-7819
978-1-5386-1325-2
0
PageRank 
References 
Authors
0.34
0
8
Name
Order
Citations
PageRank
Stanley Fujimoto1134.27
Cole A. Lyman201.35
Anton Suvorov301.35
Paul Bodily4154.32
Quinn Snell539051.47
Keith Crandall69714.34
Seth M. Bybee741.69
Mark J. Clement838446.31