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

A 2-approximation algorithm for the contigbased genomic scaffold filling problem

Hits:

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

Title of Paper:A 2-approximation algorithm for the contigbased genomic scaffold filling problem

Journal:生物信息学与计算生物学期刊

First Author:姜海涛

All the Authors:姜海涛

Document Code:FFD593D453EE4EFFA18DCB8907D6FF18

Volume:16

Issue:6

Translation or Not:No

Date of Publication:2018-12

Release Time:2019-10-25

Prev One:Can a permutation be sorted by best short swaps?

Next One:A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications