Author of the publication

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)

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 pattern matching with scaling., , , and . Inf. Process. Lett., (2023)Faster Filters for Approximate String Matching., and . ALENEX, SIAM, (2007)On-Line Construction of Parameterized Suffix Trees., , and . SPIRE, volume 5721 of Lecture Notes in Computer Science, page 31-38. Springer, (2009)Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model., , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 1185-1194. Springer, (2009)Suffix Tree of Alignment: An Efficient Index for Similar Data., , , , , , and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 337-348. Springer, (2013)Data Compression with Truncated Suffix Trees., and . Data Compression Conference, page 565. IEEE Computer Society, (2000)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)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)Suffix Array of Alignment: A Practical Index for Similar Data., , , , , , and . SPIRE, volume 8214 of Lecture Notes in Computer Science, page 243-254. Springer, (2013)Simple Implementation of String B-Trees.., and . SPIRE, volume 3246 of Lecture Notes in Computer Science, page 214-215. Springer, (2004)