Resumo

ARANGO PALACIO, César Alejandro  e  BAEZA-YATES, Ricardo. Algorithms analysis for construction of suffix arrays in linear timel. Rev. ing. univ. Medellín [online]. 2010, vol.9, n.17, pp.185-193. ISSN 1692-3324.

The advance in the investigation about suffix arrays allowed the publication for three new algorithms about the linear time construction in 2003. Before that, it had been working with algorithms in the order O(n log n) which were considered the best in this topic. At this point, it was decided to work on a project for proving which one of the algorithms was better in terms of time and computational resources. Algorithms O(n) vs were compared. O(n log n) and the O(n) vs. O(n) were also compared. Later, after the investigation at the lab, it was discovered that algorithms in the order O(n log n) are better than the others in O(n) based on time and computational resources.

Palavras-chave : suffix array; orders of growth; index; linear time; algorithm.

        · resumo em Espanhol     · texto em Espanhol     · Espanhol ( pdf )