Open AccessTwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes
Author(s) -
Ilia Minkin,
Son Pham,
Paul Medvedev
Publication year - 2016
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btw609
Subject(s) - de bruijn graph , de bruijn sequence , computer science , graph , theoretical computer science , genome , algorithm , combinatorics , mathematics , biology , genetics , gene
de Bruijn graphs have been proposed as a data structure to facilitate the analysis of related whole genome sequences, in both a population and comparative genomic settings. However, current approaches do not scale well to many genomes of large size (such as mammalian genomes).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom