Author of the publication

On the Suffix Automaton with Mismatches.

, , , and . CIAA, volume 4783 of Lecture Notes in Computer Science, page 144-156. Springer, (2007)

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

Extracting Powers and Periods in a String from Its Runs Structure., , , , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 258-269. Springer, (2010)Three Heuristics for delta-Matching: delta-BM Algorithms., , , , and . CPM, volume 2373 of Lecture Notes in Computer Science, page 178-189. Springer, (2002)String Matching., and . Encyclopedia of Algorithms, (2016)Efficient enumeration of non-equivalent squares in partial words with few holes., , , , , , , and . J. Comb. Optim., 37 (2): 501-522 (2019)Automata and Forbidden Words., , and . Inf. Process. Lett., 67 (3): 111-117 (1998)Optimal prefix and suffix queries on texts., , and . Inf. Process. Lett., 108 (5): 320-325 (2008)A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum., , , and . MFCS, volume 2747 of Lecture Notes in Computer Science, page 622-631. Springer, (2003)Constant-space string-matching in sublinear average time., , and . SEQUENCES, page 230-239. IEEE, (1997)Suffix Tree., and . Encyclopedia of Database Systems, Springer US, (2009)Algorithms for Three Versions of the Shortest Common Superstring Problem., , , , , , and . CPM, volume 6129 of Lecture Notes in Computer Science, page 299-309. Springer, (2010)