Linearizing Genomes: Exact Methods and Local Search

  • Tom DavotEmail author
  • Annie Chateau
  • Rodolphe Giroudeau
  • Mathias Weller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12011)


In this article, we address the problem of genome linearization from the perspective of Polynomial Local Search, a complexity class related to finding local optima. We prove that the linearization problem, with a neighborhood structure, the neighbor slide, is PLS-complete. On the positive side, we develop two exact methods, one using tree decompositions with an efficient dynamic programming, the other using an integer linear programming. Finally, we compare them on real instances.


  1. 1.
    Abseher, M., Musliu, N., Woltran, S.: htd – a free, open-source framework for (customized) tree decompositions and beyond. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 376–386. Springer, Cham (2017). Scholar
  2. 2.
    Biscotti, M.A., Olmo, E., Heslop-Harrison, J.S.: Repetitive DNA in eukaryotic genomes. Chromosome Res. 23(3), 415–420 (2015)CrossRefGoogle Scholar
  3. 3.
    Bongartz, P.: Resolving repeat families with long reads. BMC Bioinform. 20(232) (2019). ISSN 1471-2105
  4. 4.
    Chateau, A., Giroudeau, R.: A complexity and approximation framework for the maximization scaffolding problem. Theor. Comput. Sci. 595, 92–106 (2015)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci. 37(1), 79–100 (1988)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Kloks, T.: Treewidth, Computations and Approximations. Lecture Notes in Computer Science, vol. 842. Springer, Heidelberg (1994). Scholar
  7. 7.
    Krentel, M.: On finding and verifying locally optimal solutions. SIAM J. Comput. 19(4), 742–749 (1990)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Mandric, I., Lindsay, J., Măndoiu, I.I., Zelikovsky, A.: Scaffolding algorithms (chap. 5). In: Măndoiu, I., Zelikovsky, A. (eds.) Computational Methods for Next Generation Sequencing Data Analysis, pp. 107–132. Wiley, Hoboken (2016)Google Scholar
  9. 9.
    Schäffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM J. Comput. 20(1), 56–87 (1991)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Tabary, D., Davot, T., Weller, M., Chateau, A., Giroudeau, R.: New results about the linearization of scaffolds sharing repeated contigs. In: Kim, D., Uma, R.N., Zelikovsky, A. (eds.) COCOA 2018. LNCS, vol. 11346, pp. 94–107. Springer, Cham (2018). Scholar
  11. 11.
    Tang, H.: Genome assembly, rearrangement, and repeats. Chem. Rev. 107(8), 3391–3406 (2007)CrossRefGoogle Scholar
  12. 12.
    Tomescu, A.I., Gagie, T., Popa, A., Rizzi, R., Kuosmanen, A., Mäkinen, V.: Explaining a weighted DAG with few paths for solving genome-guided multi-assembly. IEEE/ACM Trans. Comput. Biol. Bioinform. 12(6), 1345–1354 (2015)CrossRefGoogle Scholar
  13. 13.
    Ummat, A., Bashir, A.: Resolving complex tandem repeats with long reads. Bioinformatics 30(24), 3491–3498 (2014). ISSN 1367-4803CrossRefGoogle Scholar
  14. 14.
    Weller, M., Chateau, A., Giroudeau, R.: Exact approaches for scaffolding. BMC Bioinform. 16(Suppl 14), S2 (2015)CrossRefGoogle Scholar
  15. 15.
    Weller, M., Chateau, A., Giroudeau, R.: On the linearization of scaffolds sharing repeated contigs. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 509–517. Springer, Cham (2017). Scholar
  16. 16.
    Weller, M., Chateau, A., Dallard, C., Giroudeau, R.: Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases. Algorithmica 80(6), 1771–1803 (2018)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Weller, M., Chateau, A., Giroudeau, R., Poss, M.: Scaffolding with repeated contigs using flow formulations (2018)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Tom Davot
    • 1
    Email author
  • Annie Chateau
    • 1
  • Rodolphe Giroudeau
    • 1
  • Mathias Weller
    • 2
  1. 1.LIRMM - CNRS UMR 5506MontpellierFrance
  2. 2.CNRS, LIGM (UMR 8049)Champs-s/-MarneFrance

Personalised recommendations