MAŇUCH, Ján, THACHUK, Chris, STACHO, Ladislav und CONDON, Anne, 2011. NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Natural Computing. 1 März 2011. Vol. 10, no. 1, p. 391-405. DOI 10.1007/s11047-010-9239-4.
Elsevier - Harvard (with titles)Maňuch, J., Thachuk, C., Stacho, L., Condon, A., 2011. NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Natural Computing 10, 391-405. https://doi.org/10.1007/s11047-010-9239-4
American Psychological Association 7th editionMaňuch, J., Thachuk, C., Stacho, L., & Condon, A. (2011). NP-completeness of the energy barrier problem without pseudoknots and temporary arcs. Natural Computing, 10(1), 391-405. https://doi.org/10.1007/s11047-010-9239-4
Springer - Basic (author-date)Maňuch J, Thachuk C, Stacho L, Condon A (2011) NP-completeness of the energy barrier problem without pseudoknots and temporary arcs.. Natural Computing 10:391-405. https://doi.org/10.1007/s11047-010-9239-4
Juristische Zitierweise (Stüber) (Deutsch)Maňuch, Ján/ Thachuk, Chris/ Stacho, Ladislav/ Condon, Anne, NP-completeness of the energy barrier problem without pseudoknots and temporary arcs., Natural Computing 2011, 391-405.