TwoPaCo: An efficient algorithm to build the compacted de Bruijn graph from many complete genomes. Minkin, I., Pham, S. K., & Medvedev, P. CoRR, 2016. 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
{"_id":"PkHgDkts4jb6raXkW","bibbaseid":"minkin-pham-medvedev-twopacoanefficientalgorithmtobuildthecompacteddebruijngraphfrommanycompletegenomes-2016","authorIDs":[],"author_short":["Minkin, I.","Pham, S. K.","Medvedev, P."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Ilya"],"propositions":[],"lastnames":["Minkin"],"suffixes":[]},{"firstnames":["Son","K."],"propositions":[],"lastnames":["Pham"],"suffixes":[]},{"firstnames":["Paul"],"propositions":[],"lastnames":["Medvedev"],"suffixes":[]}],"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","bibtex":"@article{DBLP:journals/corr/MinkinPM16,\n author = {Ilya Minkin and\n Son K. Pham and\n Paul Medvedev},\n title = {TwoPaCo: An efficient algorithm to build the compacted de Bruijn graph\n from many complete genomes},\n journal = {CoRR},\n volume = {abs/1602.05856},\n year = {2016},\n url = {http://arxiv.org/abs/1602.05856},\n archivePrefix = {arXiv},\n eprint = {1602.05856},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/bib/journals/corr/MinkinPM16},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Minkin, I.","Pham, S. K.","Medvedev, P."],"key":"DBLP:journals/corr/MinkinPM16","id":"DBLP:journals/corr/MinkinPM16","bibbaseid":"minkin-pham-medvedev-twopacoanefficientalgorithmtobuildthecompacteddebruijngraphfrommanycompletegenomes-2016","role":"author","urls":{"Paper":"http://arxiv.org/abs/1602.05856"},"downloads":0},"bibtype":"article","biburl":"https://dblp.org/pid/95/4828.bib","creationDate":"2020-02-06T03:17:32.230Z","downloads":0,"keywords":[],"search_terms":["twopaco","efficient","algorithm","build","compacted","bruijn","graph","many","complete","genomes","minkin","pham","medvedev"],"title":"TwoPaCo: An efficient algorithm to build the compacted de Bruijn graph from many complete genomes","year":2016,"dataSources":["rXH8WnhN9dsgLfF9T"]}