Author of the publication

Greedy Shortest Common Superstring Approximation in Compact Space.

, and . SPIRE, volume 10508 of Lecture Notes in Computer Science, page 1-13. Springer, (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

Space-Efficient Algorithms for Strings and Prefix-Sortable Graphs.. University of Helsinki, Finland, (2020)base-search.net (ftunivhelsihelda:oai:helda.helsinki.fi:10138/314808).Algorithms and Complexity on Indexing Elastic Founder Graphs., , , , , and . ISAAC, volume 212 of LIPIcs, page 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Greedy Shortest Common Superstring Approximation in Compact Space., and . SPIRE, volume 10508 of Lecture Notes in Computer Science, page 1-13. Springer, (2017)Regular Languages meet Prefix Sorting., , , and . SODA, page 911-930. SIAM, (2020)Finding All Maximal Perfect Haplotype Blocks in Linear Time., , , , and . WABI, volume 143 of LIPIcs, page 8:1-8:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Linear-time Minimization of Wheeler DFAs., , and . DCC, page 53-62. IEEE, (2022)Computing the LCP Array of a Labeled Graph., , , , , and . CPM, volume 296 of LIPIcs, page 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)An Experimental Performance Assessment of Galileo OSNMA., , , and . ICL-GNSS, page 1-7. IEEE, (2023)Longest Common Prefix Arrays for Succinct k-Spectra., , and . SPIRE, volume 14240 of Lecture Notes in Computer Science, page 1-13. Springer, (2023)Subset Wavelet Trees., , , and . SEA, volume 265 of LIPIcs, page 4:1-4:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)