From post

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.

 

Другие публикации лиц с тем же именем

Polynomial-Delay Enumeration of Maximal Common Subsequences., , , и . SPIRE, том 11811 из Lecture Notes in Computer Science, стр. 189-202. Springer, (2019)MADMX: A Novel Strategy for Maximal Dense Motif Extraction, , , , , и . CoRR, (2010)Fast Compressed Tries through Path Decompositions., и . ACM Journal of Experimental Algorithmics, (2014)A fast VLSI solution for approximate string matching.. Integr., 13 (2): 195-206 (1992)Circular sequence comparison: algorithms and applications., , , , , , и . Algorithms Mol. Biol., (2016)On the Complexity of String Matching for Graphs., , , и . ACM Trans. Algorithms, 19 (3): 21:1-21:25 (июля 2023)Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs., , , , и . IEEE Access, (2020)Linear-size suffix tries., , , и . Theor. Comput. Sci., (2016)Computing the Burrows-Wheeler transform in place and in small space., , , и . J. Discrete Algorithms, (2015)Finding the Anticover of a String., , , , , , и . CPM, том 161 из LIPIcs, стр. 2:1-2:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)