TwoPaCo: An efficient algorithm to build the compacted de Bruijn graph from many complete genomes. Minkin, I., Pham, S. K., & Medvedev, P. CoRR, 2016.
TwoPaCo: An efficient algorithm to build the compacted de Bruijn graph from many complete genomes [link]Paper  bibtex   
@article{DBLP:journals/corr/MinkinPM16,
  author    = {Ilya Minkin and
               Son K. Pham and
               Paul Medvedev},
  title     = {TwoPaCo: An efficient algorithm to build the compacted de Bruijn graph
               from many complete genomes},
  journal   = {CoRR},
  volume    = {abs/1602.05856},
  year      = {2016},
  url       = {http://arxiv.org/abs/1602.05856},
  archivePrefix = {arXiv},
  eprint    = {1602.05856},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/MinkinPM16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0