Interval scheduling maximizing minimum coverage

Veli M?kinen; Valeria Staneva; Alexandru?I. Tomescu; Daniel Valenzuela; Sebastian Wilzbach

首页> 外文期刊>Discrete Applied Mathematics >Interval scheduling maximizing minimum coverage

【24h】

Interval scheduling maximizing minimum coverage

机译：间隔调度最大化最小覆盖范围

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Abstract

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 min O (

机译：<！[cdata [ Abstract

在经典间隔调度类型的问题中，一组 n 作业，在他们的开始和结束时间的特征，需要在各种约束下由一组机器执行。在本文中，我们研究了一个新的变体，其中工作需要在大多数 k 相同的机器，使得忙碌的最小机器数量同一时间最大化。这在基因组测序和单倍型的背景下是相关的，特别是当需要修剪与基因组对齐的一组DNA读取时，使得不超过 k 读重叠，同时在整个基因组中保持尽可能多的读取覆盖。我们表明问题可以及时解决 min o （

著录项

来源
《Discrete Applied Mathematics》 |2017年第2017期|共6页
作者
Veli M?kinen; Valeria Staneva; Alexandru?I. Tomescu; Daniel Valenzuela; Sebastian Wilzbach;
展开▼
作者单位

Helsinki Institute for Information Technology HIIT Department of Computer Science University of Helsinki;

Helsinki Institute for Information Technology HIIT Department of Computer Science University of Helsinki;

Helsinki Institute for Information Technology HIIT Department of Computer Science University of Helsinki;

Helsinki Institute for Information Technology HIIT Department of Computer Science University of Helsinki;

Helsinki Institute for Information Technology HIIT Department of Computer Science University of Helsinki;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类离散数学;
关键词
Interval scheduling; Read pruning; Haplotype assembly; Max-flows;

机译：间隔调度;读取修剪;单倍型组装;最大流动;

相似文献

外文文献
中文文献
专利

1. Interval scheduling maximizing minimum coverage [J] . Veli M?kinen, Valeria Staneva, Alexandru?I. Tomescu, Discrete Applied Mathematics . 2017,第期

机译：间隔调度最大化最小覆盖范围
2. Maximizing Wireless Sensor Network Coverage With Minimum Cost Using Harmony Search Algorithm [J] . Osama Moh’d Alia, Alaa Al-Ajouri Sensors Journal, IEEE . 2017,第3期

机译：使用和声搜索算法以最小的成本最大化无线传感器网络的覆盖范围
3. Maximizing lifetime and coverage for minimum energy wireless sensor network using corona based sensor deployment [J] . Mohana Bakshi, Anindita Ray, Debashis De CSI Transactions on ICT . 2017,第1期

机译：使用基于电晕的传感器部署，最大程度地延长使用寿命和覆盖范围，以实现最低能耗的无线传感器网络
4. Inter-completion time scheduling (ICTS): non-preemptive scheduling to maximize the minimum inter-completion time [C] . Amaro, C.C., Stoyen, Engineering of Complex Computer Systems, 1998. ICECCS '98. Proceedings. Fourth IEEE International Conference on . 1998

机译：完成时间间调度（ICTS）：非抢占式调度以最大化最小完成时间
5. Fault -tolerant sensor coverage for achieving desired coverage lifetime with minimum cost [D] . Yu, Zhijun 2008

机译：容错传感器覆盖范围，以最小的成本实现所需的覆盖范围
6. Momentary maximizing in concurrent schedules with a minimum interchangeover interval [O] . João Claudio Todorov, Deisy G. Souza, Carolina M. Bori 1993

机译：在并发时间表中以最小的交换间隔实现瞬间最大化
7. Interval scheduling maximizing minimum coverage [O] . Mäkinen, Veli, Staneva, Valeria, Tomescu, Alexandru, 2015

机译：区间调度最大化最小覆盖范围
8. Income Maximizing on Concurrent Ratio-Interval Schedules of Reinforcement. [R] . Shurtleff, D., Silberberg, A. 1990

机译：最大化并行比例 - 加固间隔时间表。

Interval scheduling maximizing minimum coverage

摘要

著录项

相似文献

相关主题

期刊订阅