BibTeX record conf/wabi/LeMayWL21

download as .bib file

@inproceedings{DBLP:conf/wabi/LeMayWL21,
  author       = {Matthew LeMay and
                  Yi{-}Chieh Wu and
                  Ran Libeskind{-}Hadas},
  editor       = {Alessandra Carbone and
                  Mohammed El{-}Kebir},
  title        = {The Most Parsimonious Reconciliation Problem in the Presence of Incomplete
                  Lineage Sorting and Hybridization Is NP-Hard},
  booktitle    = {21st International Workshop on Algorithms in Bioinformatics, {WABI}
                  2021, August 2-4, 2021, Virtual Conference},
  series       = {LIPIcs},
  volume       = {201},
  pages        = {1:1--1:10},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.WABI.2021.1},
  doi          = {10.4230/LIPICS.WABI.2021.1},
  timestamp    = {Thu, 22 Jul 2021 15:58:06 +0200},
  biburl       = {https://dblp.org/rec/conf/wabi/LeMayWL21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.