Linear-Time Construction of Two-Dimensional Suffix Trees

Author： Kim Dong Na Joong Sim Jeong Park Kunsoo

ISSN： 0178-4617

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

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

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

By Na Joong Chae Giancarlo Raffaele Park Kunsoo

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

Springer Publishing Company

Access to resources Recommend Favorite

A linear-time optimal-message distributed algorithm for minimum spanning trees

By Faloutsos Michalis Molle Mart

Distributed Computing, Vol. 17, Iss. 2, 2004-08 ,pp. : 151-170

Springer Publishing Company

Access to resources Recommend Favorite

Two-dimensional Representation of Three-dimensional Systems of Homogeneous Linear Inequalities

By Kobylkin K. S.

Automation and Remote Control, Vol. 65, Iss. 3, 2004-03 ,pp. : 369-374

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Linear-Time Self-Interpretation of the Pure Lambda Calculus

By Mogensen T.Æ.

LISP and Symbolic Computation, Vol. 13, Iss. 3, 2000-09 ,pp. : 217-237

Springer Publishing Company

Access to resources Recommend Favorite

A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem

By Bonizzoni Paola

Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. : 267-285

Springer Publishing Company

Access to resources Recommend Favorite