BibTeX record conf/cpm/CarmelMTZ14

download as .bib file

@inproceedings{DBLP:conf/cpm/CarmelMTZ14,
  author       = {Amir Carmel and
                  Noa Musa{-}Lempel and
                  Dekel Tsur and
                  Michal Ziv{-}Ukelson},
  editor       = {Alexander S. Kulikov and
                  Sergei O. Kuznetsov and
                  Pavel A. Pevzner},
  title        = {The Worst Case Complexity of Maximum Parsimony},
  booktitle    = {Combinatorial Pattern Matching - 25th Annual Symposium, {CPM} 2014,
                  Moscow, Russia, June 16-18, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8486},
  pages        = {79--88},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-07566-2\_9},
  doi          = {10.1007/978-3-319-07566-2\_9},
  timestamp    = {Sat, 19 Oct 2019 20:27:16 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/CarmelMTZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics