Interval scheduling maximizing minimum coverage

Show full item record



Mäkinen , V , Staneva , V , Tomescu , A I , Valenzuela , D & Wilzbach , S 2017 , ' Interval scheduling maximizing minimum coverage ' , Discrete Applied Mathematics , vol. 225 , pp. 130-135 .

Title: Interval scheduling maximizing minimum coverage
Author: Mäkinen, Veli; Staneva, Valeria; Tomescu, Alexandru I.; Valenzuela, Daniel; Wilzbach, Sebastian
Contributor organization: Department of Computer Science
Genome-scale Algorithmics research group / Veli Mäkinen
Helsinki Institute for Information Technology
Algorithmic Bioinformatics
Date: 2017-07-10
Language: eng
Number of pages: 6
Belongs to series: Discrete Applied Mathematics
ISSN: 0166-218X
Subject: Interval scheduling
Read pruning
Haplotype assembly
111 Mathematics
Peer reviewed: Yes
Rights: cc_by_nc_nd
Usage restriction: openAccess
Self-archived version: acceptedVersion

Files in this item

Total number of downloads: Loading...

Files Size Format View
1508.07820.pdf 318.8Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record