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

dc.creator	Iliopoulos, Costas S.
dc.creator	Pinzón Ardila, Yoan
dc.date	2002-06-01
dc.date.accessioned	2022-03-03T19:57:11Z
dc.date.available	2022-03-03T19:57:11Z
dc.identifier	https://revistas.unab.edu.co/index.php/rcc/article/view/1107
dc.identifier.uri	http://test.repositoriodigital.com:8080/handle/123456789/13881
dc.description	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.	es-ES
dc.format	application/pdf
dc.language	spa
dc.publisher	Universidad Autónoma de Bucaramanga	es-ES
dc.relation	https://revistas.unab.edu.co/index.php/rcc/article/view/1107/1079
dc.rights	Derechos de autor 2002 Revista Colombiana de Computación	es-ES
dc.rights	https://creativecommons.org/licenses/by-nc-sa/4.0	es-ES
dc.source	Revista Colombiana de Computación; Vol. 3 No. 1 (2002): Revista Colombiana de Computación (Enero-Junio); 41-51	en-US
dc.source	Revista Colombiana de Computación; Vol. 3 Núm. 1 (2002): Revista Colombiana de Computación (Enero-Junio); 41-51	es-ES
dc.source	2539-2115
dc.source	1657-2831
dc.title	Recovering an LCS in O(n^2/w) time and space	es-ES
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion

Ficheros en el ítem

Ficheros	Tamaño	Formato	Ver
No hay ficheros asociados a este ítem.