Treewidth-based algorithms for the small parsimony problem on networks. Scornavacca, C. & Weller, M. Algorithms Mol. Biol., 17(1):15, 2022. Paper doi bibtex @article{DBLP:journals/almob/ScornavaccaW22,
author = {C{\'{e}}line Scornavacca and
Mathias Weller},
title = {Treewidth-based algorithms for the small parsimony problem on networks},
journal = {Algorithms Mol. Biol.},
volume = {17},
number = {1},
pages = {15},
year = {2022},
url = {https://doi.org/10.1186/s13015-022-00216-w},
doi = {10.1186/S13015-022-00216-W},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/almob/ScornavaccaW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"a9wLrzes5jWg3iytv","bibbaseid":"scornavacca-weller-treewidthbasedalgorithmsforthesmallparsimonyproblemonnetworks-2022","author_short":["Scornavacca, C.","Weller, M."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Céline"],"propositions":[],"lastnames":["Scornavacca"],"suffixes":[]},{"firstnames":["Mathias"],"propositions":[],"lastnames":["Weller"],"suffixes":[]}],"title":"Treewidth-based algorithms for the small parsimony problem on networks","journal":"Algorithms Mol. Biol.","volume":"17","number":"1","pages":"15","year":"2022","url":"https://doi.org/10.1186/s13015-022-00216-w","doi":"10.1186/S13015-022-00216-W","timestamp":"Mon, 26 Sep 2022 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/almob/ScornavaccaW22.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/almob/ScornavaccaW22,\n author = {C{\\'{e}}line Scornavacca and\n Mathias Weller},\n title = {Treewidth-based algorithms for the small parsimony problem on networks},\n journal = {Algorithms Mol. Biol.},\n volume = {17},\n number = {1},\n pages = {15},\n year = {2022},\n url = {https://doi.org/10.1186/s13015-022-00216-w},\n doi = {10.1186/S13015-022-00216-W},\n timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/almob/ScornavaccaW22.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Scornavacca, C.","Weller, M."],"key":"DBLP:journals/almob/ScornavaccaW22","id":"DBLP:journals/almob/ScornavaccaW22","bibbaseid":"scornavacca-weller-treewidthbasedalgorithmsforthesmallparsimonyproblemonnetworks-2022","role":"author","urls":{"Paper":"https://doi.org/10.1186/s13015-022-00216-w"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://dblp.org/pers/tb2/w/Weller:Mathias","dataSources":["p4oCSPTRLiiykYZHi","S8v6dBTYDW8zRm2Zp"],"keywords":[],"search_terms":["treewidth","based","algorithms","small","parsimony","problem","networks","scornavacca","weller"],"title":"Treewidth-based algorithms for the small parsimony problem on networks","year":2022}