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

String Comparison in V-Order: New Lexicographic Properties & On-line Applications., , , and . CoRR, (2015)String covering with optimal covers., and . J. Discrete Algorithms, (2018)A New Periodicity Lemma., , and . CPM, volume 3537 of Lecture Notes in Computer Science, page 257-265. Springer, (2005)Suffix arrays: what are they good for?, , and . ADC, volume 49 of CRPIT, page 17-18. Australian Computer Society, (2006)Covering a Circular String with Substrings of Fixed Length., and . Int. J. Found. Comput. Sci., 7 (1): 87-93 (1996)An Optimal Algorithm to Compute all the Covers of a String., and . Inf. Process. Lett., 50 (5): 239-246 (1994)Lempel-Ziv Factorization Using Less Time & Space., , and . Math. Comput. Sci., 1 (4): 605-623 (2008)A New Periodicity Lemma., , , and . SIAM J. Discret. Math., 20 (3): 656-668 (2006)Editorial., , and . J. Discrete Algorithms, (2018)An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings., and . Int. J. Found. Comput. Sci., 20 (6): 985-1004 (2009)