De Bruijn Superwalk with Multiplicities Problem is NP-hard

Evgeny Kapun, Fedor Tsarev. De Bruijn Superwalk with Multiplicities Problem is NP-hard. BMC Bioinformatics, 14(S-5), 2013. [doi]

Abstract

Abstract is missing.