The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2010)
Atlanta, GA, USA
Apr. 19, 2010 to Apr. 23, 2010
ISBN: 978-1-4244-6442-5
pp: 1-9
Xue Wang , Computer Science, Georgia State University, Atlanta, USA
Fasheng Qiu , Computer Science, Georgia State University, Atlanta, USA
Sushil K. Prasad , Computer Science, Georgia State University, Atlanta, USA
Guantao Chen , Mathematics and Statistics, Georgia State University, Atlanta, USA
ABSTRACT
One of the fundamental problems involving DNA sequences is to find high density segments of certain widths, for example, those regions with intensive guanine and cytosine (GC). Formally, given a sequence, each element of which has a value and a width, the maximum-density segment problem asks for the segment with the maximum density while satisfying minimum and possibly maximum width constraints. While several linear-time sequential algorithms have emerged recently due to its primitive-like utility, to our knowledge, no nontrivial parallel algorithm has yet been proposed for this topical problem. In this paper, we propose an O(log
INDEX TERMS
CITATION

G. Chen, S. K. Prasad, F. Qiu and X. Wang, "Efficient parallel algorithms for maximum-density segment problem," 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), Atlanta, GA, 2010, pp. 1-9.
doi:10.1109/IPDPS.2010.5470390
92 ms
(Ver 3.3 (11022016))