Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem, Proc. AlCoB '14, vol.8542, pp.47-58, 2014. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01007556
A complexity and approximation framework for the maximization scaffolding problem, Theoretical Computer Science, vol.595, pp.92-106, 2015. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01219622
Better approximation algorithms for scaffolding problems, Frontiers in Algorithmics: 10th International Workshop, FAW 2016, pp.17-28, 2016. ,
Instance guaranteed ratio on greedy heuristic for genome scaffolding, COCOA, vol.10043, pp.294-308, 2016. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01378584
Scaffolding algorithms, Computational Methods for Next Generation Sequencing Data Analysis, pp.107-132, 2016. ,
DNA sequencing technologies, Nat Protoc, vol.12, issue.2, pp.213-218, 2017. ,
Hybrid assembly with long and short reads improves discovery of gene family expansions, BMC Genomics, vol.18, issue.1, p.541, 2017. ,
On the complexity of scaffolding problems: from cliques to sparse graphs, Combinatorial Optimization and Applications: 9th International Conference, pp.409-423, 1820. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01250982
Exact approaches for scaffolding, BMC bioinformatics, vol.16, p.2, 2015. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01219627
Scaffolding problems revisited: Complexity, approximation and fixed parameter tractable algorithms, and some special cases, Algorithmica, vol.80, issue.6, pp.1771-1803, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01833303