LABARRE, A. und VERWER, S., 2014. Merging Partially Labelled Trees: Hardness and a Declarative Programming Solution. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Computational Biology and Bioinformatics, IEEE/ACM Transactions on, IEEE/ACM Trans. Comput. Biol. and Bioinf. 1 März 2014. Vol. 11, no. 2, p. 389-397. DOI 10.1109/TCBB.2014.2307200.
Elsevier - Harvard (with titles)Labarre, A., Verwer, S., 2014. Merging Partially Labelled Trees: Hardness and a Declarative Programming Solution. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Computational Biology and Bioinformatics, IEEE/ACM Transactions on, IEEE/ACM Trans. Comput. Biol. and Bioinf. 11, 389-397. https://doi.org/10.1109/TCBB.2014.2307200
American Psychological Association 7th editionLabarre, A., & Verwer, S. (2014). Merging Partially Labelled Trees: Hardness and a Declarative Programming Solution. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Computational Biology and Bioinformatics, IEEE/ACM Transactions On, IEEE/ACM Trans. Comput. Biol. And Bioinf., 11(2), 389-397. https://doi.org/10.1109/TCBB.2014.2307200
Springer - Basic (author-date)Labarre A, Verwer S (2014) Merging Partially Labelled Trees: Hardness and a Declarative Programming Solution. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Computational Biology and Bioinformatics, IEEE/ACM Transactions on, IEEE/ACM Trans. Comput. Biol. and Bioinf. 11:389-397. https://doi.org/10.1109/TCBB.2014.2307200
Juristische Zitierweise (Stüber) (Deutsch)Labarre, A./ Verwer, S., Merging Partially Labelled Trees: Hardness and a Declarative Programming Solution, IEEE/ACM Transactions on Computational Biology and Bioinformatics, Computational Biology and Bioinformatics, IEEE/ACM Transactions on, IEEE/ACM Trans. Comput. Biol. and Bioinf. 2014, 389-397.