Recovering an LCS in O(n^2/w) time and space

  • Costas S. Iliopoulos Departament of Computer Science, King's College London, Strand, London, WC2R 2LS, England,
  • Yoan Pinzón Ardila Laboratorio de Cómputo Especializado, Universidad Autónoma de Bucaramanga, Calle 48 No 39-234, Bucaramanga, Colombia
Abstract How to Cite Downloads

Abstract

Here we make use of word-level parallelism to recover a longest common subsequence of two input strings both of length n in O(n2/w)  time and space, where w is the number of bits in a machine word. For the special case where one of the input atrings is close to w its complexity is reduced to linear time and space.

Keywords: Longest Common Subsequence, Bit-parallelism.

How to Cite
Iliopoulos, C. S., & Pinzón Ardila, Y. (2002). Recovering an LCS in O(n^2/w) time and space. Revista Colombiana De Computación, 3(1), 41–51. Retrieved from https://revistas.unab.edu.co/rcc/article/view/1107

Downloads

Download data is not yet available.
Published
2002-06-01
Issue
Vol. 3 No. 1 (2002): Revista Colombiana de Computación (Enero-Junio)
Section
Article of scientific and technological research
Escanea para compartir
QR Code
Article metrics
Abstract views
Galley views
PDF Views
HTML views
Other views

Altmetric