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

Optimal Algorithms for Computing the canonical form of a circular string., and . Theor. Comput. Sci., 92 (1): 87-105 (1992)A Characterization of the Squares in a Fibonacci String., , and . Theor. Comput. Sci., 172 (1-2): 281-291 (1997)A taxonomy of suffix array construction algorithms., , and . Stringology, page 1-30. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2005)Computing the Minimum k-Cover of a String., , , , and . Stringology, page 51-64. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2003)A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach., , and . Stringology, page 56-43. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2002)An Optimal Algorithm to Compute all the Covers of a String., and . Inf. Process. Lett., 50 (5): 239-246 (1994)Sorting suffixes of two-pattern strings., and . Int. J. Found. Comput. Sci., 16 (6): 1135-1144 (2005)String Comparison in V-Order: New Lexicographic Properties & On-line Applications., , , and . CoRR, (2015)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)