Author of the publication

Prefix-Free Parsing for Building Big BWTs.

, , , and . WABI, volume 113 of LIPIcs, page 2:1-2:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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 Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity.. MFCS, volume 6907 of Lecture Notes in Computer Science, page 158-169. Springer, (2011)Outlier Detection for DNA Fragment Assembly, , and . CoRR, (2011)Building large updatable colored de Bruijn graphs via merging., , and . Bioinform., 35 (14): i51-i60 (2019)Kohdista: an efficient method to index and query possible Rmap alignments., , and . Algorithms Mol. Biol., 14 (1): 25 (2019)Assessing putative bias in prediction of anti-microbial resistance from real-world genotyping data under explicit causal assumptions., , , and . Artif. Intell. Medicine, (2022)Assessing putative bias in prediction of anti-microbial resistance from real-world genotyping data under explicit causal assumptions., , , and . CoRR, (2021)Fast and accurate correction of optical mapping data via spaced seeds., , , , and . Bioinform., 36 (9): 2974 (2020)Portable nanopore analytics: are we there yet?, , , , , , and . Bioinform., 36 (16): 4399-4405 (2020)Efficient Construction of a Complete Index for Pan-Genomics Read Alignment., , , , , and . J. Comput. Biol., 27 (4): 500-513 (2020)CSTs for Terabyte-Sized Data., , , , , and . DCC, page 93-102. IEEE, (2022)