کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4949682 1440198 2017 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Interval scheduling maximizing minimum coverage
ترجمه فارسی عنوان
برنامه ریزی فاصله حداکثر پوشش حداقل
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
چکیده انگلیسی
In the classical interval scheduling type of problems, a set of n jobs, characterized by their start and end time, needs to be executed by a set of machines, under various constraints. In this paper we study a new variant in which the jobs need to be assigned to at most k identical machines, such that the minimum number of machines that are busy at the same time is maximized. This is relevant in the context of genome sequencing and haplotyping, specifically when a set of DNA reads aligned to a genome needs to be pruned so that no more than k reads overlap, while maintaining as much read coverage as possible across the entire genome. We show that the problem can be solved in time minO(n2logk∕logn),O(nklogk) by using max-flows. We also give an O(nlogn)-time approximation algorithm with approximation ratio ρ=k⌊k∕2⌋.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 225, 10 July 2017, Pages 130-135
نویسندگان
, , , , ,