Recovering an LCS in O(n^2/w) time and space
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidad Autónoma de Bucaramanga
2002-06-01
|
| Series: | Revista Colombiana de Computación |
| Online Access: | https://revistas.unab.edu.co/index.php/rcc/article/view/1107 |
| id |
doaj-4a568fbd13e849b4ba306a3b19e98ede |
|---|---|
| record_format |
Article |
| spelling |
doaj-4a568fbd13e849b4ba306a3b19e98ede2020-11-25T04:04:34ZengUniversidad Autónoma de BucaramangaRevista Colombiana de Computación1657-28312539-21152002-06-0131Recovering an LCS in O(n^2/w) time and spaceCostas S. Iliopoulos0Yoan Pinzón Ardila1Departament of Computer Science, King's College London, Strand, London, WC2R 2LS, England,Laboratorio de Cómputo Especializado, Universidad Autónoma de Bucaramanga, Calle 48 No 39-234, Bucaramanga, Colombia 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. https://revistas.unab.edu.co/index.php/rcc/article/view/1107 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Costas S. Iliopoulos Yoan Pinzón Ardila |
| spellingShingle |
Costas S. Iliopoulos Yoan Pinzón Ardila Recovering an LCS in O(n^2/w) time and space Revista Colombiana de Computación |
| author_facet |
Costas S. Iliopoulos Yoan Pinzón Ardila |
| author_sort |
Costas S. Iliopoulos |
| title |
Recovering an LCS in O(n^2/w) time and space |
| title_short |
Recovering an LCS in O(n^2/w) time and space |
| title_full |
Recovering an LCS in O(n^2/w) time and space |
| title_fullStr |
Recovering an LCS in O(n^2/w) time and space |
| title_full_unstemmed |
Recovering an LCS in O(n^2/w) time and space |
| title_sort |
recovering an lcs in o(n^2/w) time and space |
| publisher |
Universidad Autónoma de Bucaramanga |
| series |
Revista Colombiana de Computación |
| issn |
1657-2831 2539-2115 |
| publishDate |
2002-06-01 |
| 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.
|
| url |
https://revistas.unab.edu.co/index.php/rcc/article/view/1107 |
| work_keys_str_mv |
AT costassiliopoulos recoveringanlcsinon2wtimeandspace AT yoanpinzonardila recoveringanlcsinon2wtimeandspace |
| _version_ |
1724436168015085568 |