On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time

Author： Na Joong Chae   Giancarlo Raffaele   Park Kunsoo  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.48, Iss.2, 2007-06, pp. : 173-186

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Linear-Time Construction of Two-Dimensional Suffix Trees

By Kim Dong   Na Joong   Sim Jeong   Park Kunsoo  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 269-297

Springer Publishing Company

Access to resources Recommend Favorite

O(log log N) Time Algorithms for Hamiltonian Suffix and Min-Max-Pair Heap Operations on the Hypercube

By Das S.K.   Pinotti M.C.  

Journal of Parallel and Distributed Computing, Vol. 48, Iss. 2, 1998-02 ,pp. : 200-211

Academic Press

Access to resources Recommend Favorite

Fully dynamic distributed search trees can be balanced in O(lg2 N) time

By Barillari F.   Nardelli E.   Pepe M.  

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 11, 2002-11 ,pp. : 1617-1628

Academic Press

Access to resources Recommend Favorite

Addition in log 2 n + O(1) steps on average A simple analysis

By Beigel R.   Gasarch B.   Ming L.   Louxin Z.  

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 245-248

Elsevier

Access to resources Recommend Favorite

Two-dimensional on-line bin packing problem with rotatable items

By Fujita S.   Hada T.  

Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. : 939-952

Elsevier

Access to resources Recommend Favorite