uZ2XHlk9sc2WqhEKVJljj36GsLPi96ZU5aEVarhxQdPKfuYijiPdwRCsryMG
Current position: Home >> Scientific Research >> Paper Publications

Minimize Maximum Coverage of Fragment Alignment Selection

Hits:

Institution:计算机科学与技术学院

Title of Paper:Minimize Maximum Coverage of Fragment Alignment Selection

Journal:BIBM2023

First Author:王雨阳

Document Code:7ECBD23931B94DDD9454DB0247D48C03

Number of Words:5

Translation or Not:No

Date of Publication:2023-12

Release Time:2024-02-23

Prev One:Approximation algorithms for sorting by bounded singleton moves

Next One:Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs