Article added to library!
Pubchase is a service of - free, open access, crowdsourced protocols repository. Explore protocols.
Sign in
Reset password
or connect with
By signing in you are agreeing to our
Terms Of Service and Privacy Policy
Dec 04, 2014
Bioinformatics (Oxford, England)
MOTIVATION: Genomics is expanding from a single reference per species paradigm into a more comprehensive pan-genome approach that analyzes multiple individuals together. A compressed de Bruijn graph is a sophisticated data structure for representing the genomes of entire populations. It robustly encodes shared segments, simple single-nucleotide polymorphisms and complex structural variations far beyond what can be represented in a collection of linear sequences alone. RESULTS: We explore deep topological relationships between suffix trees and compressed de Bruijn graphs and introduce an algorithm, splitMEM, that directly constructs the compressed de Bruijn graph in time and space linear to the total number of genomes for a given maximum genome size. We introduce suffix skips to traverse several suffix links simultaneously and use them to efficiently decompose maximal exact matches into graph nodes. We demonstrate the utility of splitMEM by analyzing the nine-strain pan-genome of Bacillus anthracis and up to 62 strains of Escherichia coli, revealing their core-genome properties. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail:

Downloading PDF to your library...

Uploading PDF...

PDF uploading

Delete tag:

The link you entered does not seem to be valid

Please make sure the link points to contains a valid shared_access_token