
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds
April 2013 (vol. 24 no. 4)
pp. 724733
ASCII Text  x  
C. E. R. Alves, E. N. Caceres, Siang Wun Song, "Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds," IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 4, pp. 724733, April, 2013.  
BibTex  x  
@article{ 10.1109/TPDS.2012.149, author = {C. E. R. Alves and E. N. Caceres and Siang Wun Song}, title = {Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {24}, number = {4}, issn = {10459219}, year = {2013}, pages = {724733}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.149}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds IS  4 SN  10459219 SP724 EP733 EPD  724733 A1  C. E. R. Alves, A1  E. N. Caceres, A1  Siang Wun Song, PY  2013 KW  Parallel algorithms KW  Algorithm design and analysis KW  Program processors KW  Computational modeling KW  Materials KW  Amino acids KW  Multiprocessor interconnection KW  communication rounds KW  All maximal subsequences problem KW  maximum subsequence problem KW  parallel algorithm KW  coarsegrained multicomputer VL  24 JA  IEEE Transactions on Parallel and Distributed Systems ER   
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.149
Web Extra: View Supplemental Material(PDF)
Given a sequence A of real numbers, we wish to find a list of all nonoverlapping contiguous subsequences of A that are maximal. A maximal subsequence M of A has the property that no proper subsequence of M has a greater sum of values. Furthermore, M may not be contained properly within any subsequence of A with this property. This problem has several applications in Computational Biology and can be solved sequentially in linear time. We present a BSP/CGM algorithm that solves this problem using p processors in O(A=p) time and O(A=p) space per processor. The algorithm uses a constant number of communication rounds of size at most O(A=p). Thus, the algorithm achieves linear speedup and is highly scalable. To our knowledge, there are no previous known parallel BSP/CGM algorithms to solve this problem.
Index Terms:
Parallel algorithms,Algorithm design and analysis,Program processors,Computational modeling,Materials,Amino acids,Multiprocessor interconnection,communication rounds,All maximal subsequences problem,maximum subsequence problem,parallel algorithm,coarsegrained multicomputer
Citation:
C. E. R. Alves, E. N. Caceres, Siang Wun Song, "Finding All Maximal Contiguous Subsequences of a Sequence of Numbers in O(1) Communication Rounds," IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 4, pp. 724733, April 2013, doi:10.1109/TPDS.2012.149
Usage of this product signifies your acceptance of the Terms of Use.