Linear‐Time Construction of Two‐Dimensional Suffix Trees

0.00 Avg rating—0 Votes

Article ID:	iaor20112032
Volume:	59
Issue:	2
Start Page Number:	269
End Page Number:	297
Publication Date:	Feb 2011
Journal:	Algorithmica
Authors:	Kim Kyue, Na Chae, Sim Seop, Park Kunsoo
Keywords:	divide and conquer

Abstract:

The two-dimensional suffix tree of a matrix A is a compacted tree that represents all square submatrices of A. We present the first complete version of a deterministic linear-time algorithm to construct the two-dimensional suffix tree by applying a divide-and-conquer approach.

Reviews

Required fields are marked *. Your email address will not be published.