Efficient representations of row-sorted 1-variant matrices for parallel string applications

Authors:
Carlos Eduardo Rodrigues Alves;Edson Norberto Cáceres;Siang Wun Song
Affiliations:
Universidade São Judas Tadeu, Brazil;Universidade Federal de Mato Grosso do Sul, Brazil;Universidade de São Paulo, Brazil
Venue:
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Year:
2007

Citing 6
Cited 1

Introduction to algorithms

Introduction to algorithms
Efficient parallel algorithms for string editing and related problems

SIAM Journal on Computing
Parallel Algorithms for the Longest Common Subsequence Problem

IEEE Transactions on Parallel and Distributed Systems
A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem

Algorithmica
An all-substrings common subsequence algorithm

Discrete Applied Mathematics
All semi-local longest common subsequences in subquadratic time

CSR'06 Proceedings of the First international computer science conference on Theory and Applications

Note: A fast algorithm for multiplying min-sum permutations

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the efficient storage of row-sorted 1-variant (m + 1) × (n + 1) matrices, m n, that have the following properties: the rows are sorted in strictly increasing order and the set of elements of each row differs only by one single element from the set of elements of the next row. It has been shown that row-sorted 1-variant matrices are important in several parallel string comparison applications. Due to the large amount of redundancy in the row elements, we investigate efficient data structures to store such matrices. In this paper we propose a representation that stores a row-sorted 1-variant matrix in O(m log m) space and access time of O(log m) and can be constructed in O(m log m) time. We thus seek a representation that constitutes a nice balance between access time, representation construction time, and space requirement.