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 logm) space and access time of O(logm) and can be constructed in O(m logm) time. We thus seek a representation that constitutes a nice balance between access time, representation construction time, and space requirement.
Partially supported by FAPESP Proc. No. 2004/08928-3, CNPq Proc. No. 55.0094/05-9, 30.5362/06-2, 30.2942/04-1, 62.0123/04-4, 48.5460/06-8 and FUNDECT 41/100.115/2006.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alves, C.E.R.: Coarse-Grained Parallel Algorithms for String Alignment Problems (in Portuguese). PhD thesis, Department of Computer Science - University of São Paulo (2002)
Alves, C.E.R., Cáceres, E.N., Song, S.W.: Sequential and parallel algorithms for the all-substrings longest common subsequence problem. Technical report, Universidade de São Paulo (April 2003)
Alves, C.E.R., Cáceres, E.N., Song, S.W.: An all-substrings common subsequence algorithm. 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Electronic Notes in Discrete Mathematics 19, 133–139 (2005)
Alves, C.E.R., Cáceres, E.N., Song, S.W.: A coarse-grained parallel algorithm for the all-substrings longest common subsequence problem. Algorithmica 45(3), 301–335 (2006)
Alves, C.E.R., Cáceres, E.N., Song, S.W.: An all-substrings common subsequence algorithm. Discrete Applied Mathematics (to Appear, 2007)
Alves, C.E.R., Lago, A.P., Vellozo, A.P.: Alignment with non-overlapping inversions in O(n 3 logn) time. 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics. Electronic Notes in Discrete Mathematics 19, 365–371 (2005)
Apostolico, A., Atallah, M.J., Larmore, L.L., Macfaddin, S.: Efficient parallel algorithms for string editing and related problems. SIAM J. Comput. 5(19), 968–988 (1990)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge, MA (1989)
Lu, M., Lin, H.: Parallel algorithms for the longest common subsequence problem. IEEE Transactions on Parallel and Distributed Systems 5(8), 835–848 (1994)
Pevzner, P.A.: Computational Molecular Biology - An Algorithmic Approach. The MIT Press, Cambridge, MA (2000)
Tiskin, A.: All semi-local longest common subsequences in subquadratic time. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 352–363. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alves, C.E.R., Cáceres, E.N., Song, S.W. (2007). Efficient Representations of Row-Sorted 1-Variant Matrices for Parallel String Applications. In: Jin, H., Rana, O.F., Pan, Y., Prasanna, V.K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2007. Lecture Notes in Computer Science, vol 4494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72905-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-72905-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72904-4
Online ISBN: 978-3-540-72905-1
eBook Packages: Computer ScienceComputer Science (R0)