@inproceedings{DBLP:conf/wabi/ScornavaccaW21,
  author       = {C{\'{e}}line Scornavacca and
                  Mathias Weller},
  title        = {Treewidth-Based Algorithms for the Small Parsimony Problem on Networks},
  booktitle    = {21st International Workshop on Algorithms in Bioinformatics, {WABI}
                  2021, August 2-4, 2021, Virtual Conference},
  pages        = {6:1--6:21},
  year         = {2021},
  crossref     = {DBLP:conf/wabi/2021},
  url          = {https://doi.org/10.4230/LIPIcs.WABI.2021.6},
  doi          = {10.4230/LIPICS.WABI.2021.6},
  timestamp    = {Thu, 22 Jul 2021 15:39:38 +0200},
  biburl       = {https://dblp.org/rec/conf/wabi/ScornavaccaW21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"pqKX5GPyfkJ6mbG82","bibbaseid":"scornavacca-weller-treewidthbasedalgorithmsforthesmallparsimonyproblemonnetworks-2021","author_short":["Scornavacca, C.","Weller, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","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","booktitle":"21st International Workshop on Algorithms in Bioinformatics, WABI 2021, August 2-4, 2021, Virtual Conference","pages":"6:1–6:21","year":"2021","crossref":"DBLP:conf/wabi/2021","url":"https://doi.org/10.4230/LIPIcs.WABI.2021.6","doi":"10.4230/LIPICS.WABI.2021.6","timestamp":"Thu, 22 Jul 2021 15:39:38 +0200","biburl":"https://dblp.org/rec/conf/wabi/ScornavaccaW21.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/wabi/ScornavaccaW21,\n author = {C{\\'{e}}line Scornavacca and\n Mathias Weller},\n title = {Treewidth-Based Algorithms for the Small Parsimony Problem on Networks},\n booktitle = {21st International Workshop on Algorithms in Bioinformatics, {WABI}\n 2021, August 2-4, 2021, Virtual Conference},\n pages = {6:1--6:21},\n year = {2021},\n crossref = {DBLP:conf/wabi/2021},\n url = {https://doi.org/10.4230/LIPIcs.WABI.2021.6},\n doi = {10.4230/LIPICS.WABI.2021.6},\n timestamp = {Thu, 22 Jul 2021 15:39:38 +0200},\n biburl = {https://dblp.org/rec/conf/wabi/ScornavaccaW21.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Scornavacca, C.","Weller, M."],"key":"DBLP:conf/wabi/ScornavaccaW21","id":"DBLP:conf/wabi/ScornavaccaW21","bibbaseid":"scornavacca-weller-treewidthbasedalgorithmsforthesmallparsimonyproblemonnetworks-2021","role":"author","urls":{"Paper":"https://doi.org/10.4230/LIPIcs.WABI.2021.6"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","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":2021}