| No. |
Title |
Author |
Year |
| 1 |
Beyond the Longest Letter-Duplicated Subsequence Problem |
Lai, Wenfeng et al. |
2022 |
| 2 |
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms |
Lafond, Manuel et al. |
2020 |
| 3 |
The Tandem Duplication Distance Is NP-Hard |
Lafond, Manuel et al. |
2020 |
| 4 |
A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem |
Jiang, Haitao et al. |
2019 |
| 5 |
Front Matter, Table of Contents, Preface, Conference Organization |
Navarro, Gonzalo et al. |
2018 |
| 6 |
LIPIcs, Volume 105, CPM'18, Complete Volume |
Navarro, Gonzalo et al. |
2018 |
| 7 |
Genomic Scaffold Filling Revisited |
Jiang, Haitao et al. |
2016 |
| 8 |
On the General Chain Pair Simplification Problem |
Fan, Chenglin et al. |
2016 |
