Author of the publication

Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance.

, , , and . IWOCA, volume 8986 of Lecture Notes in Computer Science, page 49-61. Springer, (2014)

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

Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time., , , and . WABI, volume 88 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Efficient Identification of k-Closed Strings., , , , , and . EANN, volume 744 of Communications in Computer and Information Science, page 583-595. Springer, (2017)Property Suffix Array with Applications., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 290-302. Springer, (2018)Making de Bruijn Graphs Eulerian., , , , , and . CPM, volume 223 of LIPIcs, page 12:1-12:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)String Sanitization Under Edit Distance: Improved and Generalized., , , and . CPM, volume 191 of LIPIcs, page 19:1-19:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Bidirectional String Anchors: A New String Sampling Mechanism., and . ESA, volume 204 of LIPIcs, page 64:1-64:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Optimal Computation of all Repetitions in a Weighted String., and . ICABD, volume 1146 of CEUR Workshop Proceedings, page 9-15. CEUR-WS.org, (2014)Influence maximization in the presence of vulnerable nodes: A ratio perspective., , , and . Theor. Comput. Sci., (2021)Symbolic Regression is NP-hard., and . CoRR, (2022)Pattern Masking for Dictionary Matching., , , , , , and . ISAAC, volume 212 of LIPIcs, page 65:1-65:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)