Publication

Title	DOI
TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes	Bioinformatics, Volume 33, Issue 24, 15 December 2017, Pages 4024–4032; doi: 10.1093/bioinformatics/btw609
Repeat associated mechanisms of genome evolution and function revealed by the Mus caroli and Mus pahari genomes	Genome Res. 2018 Apr; 28(4): 448–459; doi: 10.1101/gr.234096.117
Chromosome assembly of large and complex genomes using multiple references	Genome research. October 19, 2018; doi: 10.1101/gr.236273.118
The Pharmacogenomics of Bipolar Disorder study (PGBD): identification of genes for lithium response in a prospective sample	BMC Psychiatry. 2016 May 5;16:129; doi: 10.1186/s12888-016-0732-x
Pagerank based clustering of hypertext document collections	doi: 10.1145/1390334.1390549
Cerulean: a hybrid assembly using high throughput short and long reads	Lecture Notes in Computer Science(), vol 8126. Springer, Berlin, Heidelberg; doi: 10.1007/978-3-642-40453-5_27

Title

TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes

DOI

Bioinformatics, Volume 33, Issue 24, 15 December 2017, Pages 4024–4032; doi: 10.1093/bioinformatics/btw609

Title

Repeat associated mechanisms of genome evolution and function revealed by the Mus caroli and Mus pahari genomes

DOI

Genome Res. 2018 Apr; 28(4): 448–459; doi: 10.1101/gr.234096.117

Title

Chromosome assembly of large and complex genomes using multiple references

DOI

Genome research. October 19, 2018; doi: 10.1101/gr.236273.118

Title

The Pharmacogenomics of Bipolar Disorder study (PGBD): identification of genes for lithium response in a prospective sample

DOI

BMC Psychiatry. 2016 May 5;16:129; doi: 10.1186/s12888-016-0732-x

Title

Pagerank based clustering of hypertext document collections

DOI

doi: 10.1145/1390334.1390549

Title

Cerulean: a hybrid assembly using high throughput short and long reads

DOI

Lecture Notes in Computer Science(), vol 8126. Springer, Berlin, Heidelberg; doi: 10.1007/978-3-642-40453-5_27