Abstract
Linear array with reconfigurable pipelined bus system (LARPBS) is a parallel computational model based on the optical bus system. In this paper, an O(1) time algorithm on LARPBS for prefix computation based on the maximum operation is presented. We also present a fast and efficient sequence alignment algorithm on LARPBS. For two sequences with length of m, n respectively, the algorithm can be implemented in O(mn/p) time with p processors(1≤p≤max{m,n}). Since the time complexity of the algorithm can be adjusted by choosing different number of processors p , the algorithm is highly scalable.
This paper is supported in part by the Chinese National Natural Science Foundation under grant No. 60473012, Chinese National Foundation for Science and Technology Development under contract 2003BA614A-14, and Natural Science Foundation of Jiangsu Province under contract BK2005047.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chen, Z., Guo-Liang, C.: Parallel algorithms for approximate string matching on PRAM and LARPBS. Journal of Software 15(2) (2004)
Gotoh, O.: An improved algorithm for matching biological sequences. J. Molec. Biol. 162, 705–708 (1982)
Mayers, E.W., Miller, W.: Optimal Alignment in Linear Space. Comput. Appl. Biosci. 4(1), 11–17 (1998)
Hirschberg, D.S.: A Linear Space Algorithm for Computing Maximal Common Subsequences. Commun. ACM 18(6), 341–343 (1975)
Aggarwal, A., Park, J.: Notes on Searching in Multidimensional Monotone Arrays. In: Proc. 29th Ann. IEEE Symp. Foundations of Comput. Sci., pp. 497–512 (1988)
Apostolico, A., Atallah, M., Larmore, L., Mcfaddin, S.: Efficient Parallel Algorithms for String Editing and Related Problems. SIAM J. Computing 19, 968–988 (1990)
Lu, M., Lin, H.: Parallel Algorithms for the Longest Common Subsequence Problem. IEEE Transaction on Parallel and Distributed System 5(8) (August 1994)
Robert, Y., Tchuente, M.: A Sytolic Array for the Longest Common Subsequence Problem. Inform. Process. Lett. 21, 191–198 (1985)
Chang, J.H., Ibarra, O.H., Pallis, M.A.: Parallel Parsing on a one-way array of finite-state machines. IEEE Trans. Computers C-36, 64–75 (1987)
Luce, G., Myoupo, J.F.: Systolic-based Parallel Architecture for the Longest Common Subsequences Problem. Integration 25(1), 53–70 (1998)
Freschi, V., Bogliolo, A.: Longest Common Subsequence between Run-length-encoded Strings: a New Algorithm with Improved Parallelism. Information Processing Letters 90(4), 167–173 (2004)
Pan, Y., Li, K.: Linear Array with a Reconfigurable Pipelined Bus System – Concepts and Applications. Journal of Information Science 106, 237–258 (1998)
Aluru, S., Futamura, N., Mehrotra, K.: Parallel Biological Sequence Comparison Using Prefix Computations. Journal of Parallel and Distributed Computing 63(3), 264–272 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, L., Juan, C., Pan, Y. (2005). Fast Scalable Algorithm on LARPBS for Sequence Alignment. In: Chen, G., Pan, Y., Guo, M., Lu, J. (eds) Parallel and Distributed Processing and Applications - ISPA 2005 Workshops. ISPA 2005. Lecture Notes in Computer Science, vol 3759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576259_20
Download citation
DOI: https://doi.org/10.1007/11576259_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29770-3
Online ISBN: 978-3-540-32115-6
eBook Packages: Computer ScienceComputer Science (R0)