Author of the publication

On-Line Construction of Parameterized Suffix Trees.

, , and . SPIRE, volume 5721 of Lecture Notes in Computer Science, page 31-38. Springer, (2009)

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

Order Preserving Matching, , , , , , , and . CoRR, (2013)Fast Matching Method for DNA Sequences., , and . ESCAPE, volume 4614 of Lecture Notes in Computer Science, page 271-281. Springer, (2007)Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk).. ISAAC, volume 64 of LIPIcs, page 2:1-2:1. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Algorithm Engineering for All-Pairs Suffix-Prefix Matching., and . SEA, volume 75 of LIPIcs, page 14:1-14:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Covering a String., , and . CPM, volume 684 of Lecture Notes in Computer Science, page 54-62. Springer, (1993)A Simple Construction of Two-Dimensional Suffix Trees in Linear Time., , , and . CPM, volume 4580 of Lecture Notes in Computer Science, page 352-364. Springer, (2007)Fast Multiple Order-Preserving Matching Algorithms., , , , , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 248-259. Springer, (2015)New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms., , and . ICISC, volume 2587 of Lecture Notes in Computer Science, page 264-282. Springer, (2002)O(n2log n) Time On-Line Construction of Two-Dimensional Suffix Trees., , and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 273-282. Springer, (2005)An O(log N log log N) time RMESH algorithm for the simple polygon visibility problem., , and . ISPAN, page 151-158. IEEE Computer Society, (1994)