Engineering a Lightweight Suffix Array Construction Algorithm

Author： Manzini Giovanni   Ferragina Paolo  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.40, Iss.1, 2004-06, pp. : 33-50

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

An algorithm for suffix stripping

By Porter M.F.  

Program: electronic library & information systems, Vol. 40, Iss. 3, 2006-07 ,pp. : 211-218

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

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

A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays

By Hon Wing-Kai   Lam Tak-Wah   Sadakane Kunihiko   Sung Wing-Kin   Yiu Siu-Ming  

Algorithmica, Vol. 48, Iss. 1, 2007-06 ,pp. : 23-36

Springer Publishing Company

Access to resources Recommend Favorite

Lightweight Formalisation in Support of Requirements Engineering

By Hesketh J.  

Automated Software Engineering, Vol. 5, Iss. 2, 1998-04 ,pp. : 183-210

Springer Publishing Company

Access to resources Recommend Favorite

An Improved Algorithm for Array Alignment

By Milosavljević I.  

Journal of Parallel and Distributed Computing, Vol. 58, Iss. 1, 1999-07 ,pp. : 44-67

Academic Press

Access to resources Recommend Favorite