Author of the publication

Disentangled Long-Read De Bruijn Graphs via Optical Maps.

, , , , and . WABI, volume 88 of LIPIcs, page 1:1-1:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The expected number of runs in a word., and . Australas. J Comb., (2008)Testing Stream Ciphers by Finding the Longest Substring of a Given Density., , and . ACISP, volume 5594 of Lecture Notes in Computer Science, page 122-133. Springer, (2009)A taxonomy of suffix array construction algorithms., , and . ACM Comput. Surv., 39 (2): 4 (2007)Fast and efficient compression of high-throughput sequencing reads., , , and . BCB, page 325-334. ACM, (2015)Lempel-Ziv Compression.. Encyclopedia of Algorithms, (2016)On the Size of Lempel-Ziv and Lyndon Factorizations., , , , and . CoRR, (2016)An efficient, versatile approach to suffix sorting., and . ACM Journal of Experimental Algorithmics, (2007)Scalable Similarity Search for Molecular Descriptors., and . SISAP, volume 10609 of Lecture Notes in Computer Science, page 207-219. Springer, (2017)Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory., , and . SPIRE, volume 4209 of Lecture Notes in Computer Science, page 122-133. Springer, (2006)Efficient Indexed Alignment of Contigs to Optical Maps., , and . WABI, volume 8701 of Lecture Notes in Computer Science, page 68-81. Springer, (2014)