On NP-Hardness of the Paired de Bruijn Sound Cycle Problem
The paired de Bruijn graph is an extension of de Bruijn graph incorporating mate pair information for genome assembly proposed by Mevdedev et al. However, unlike in an ordinary de Bruijn graph, not every path or cycle in a paired de Bruijn graph will spell a string, because there is an additional soundness constraint on the path. In this paper we show that the problem of checking if there is a sound cycle in a paired de Bruijn graph is NP-hard in general case. We also explore some of its special cases, as well as a modified version where the cycle must also pass through every edge.
Keywordspaired de Bruijn graph genome assembly complexity NP-hard
Unable to display preview. Download preview PDF.
- 2.Kapun, E., Tsarev, F.: De Bruijn superwalk with multiplicities problem is NP-hard. BMC Bioinformatics 14(suppl. 5), S7 (2013)Google Scholar
- 3.Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computation. The IBM Research Symposia Series, pp. 85–103. Plenum Press (1972)Google Scholar
- 9.Pham, S.: Mate-pair consistency and generating problems. In: Talk at RECOMB Satellite Conference on Open Problems in Algorithmic Biology (2012)Google Scholar