Cophenetic Distances: A Near-Linear Time Algorithmic Framework

Pawel Górecki, Alexey Markin, Oliver Eulenstein. Cophenetic Distances: A Near-Linear Time Algorithmic Framework. In Lusheng Wang, Daming Zhu, editors, Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings. Volume 10976 of Lecture Notes in Computer Science, pages 168-179, Springer, 2018. [doi]

@inproceedings{GoreckiME18,
  title = {Cophenetic Distances: A Near-Linear Time Algorithmic Framework},
  author = {Pawel Górecki and Alexey Markin and Oliver Eulenstein},
  year = {2018},
  doi = {10.1007/978-3-319-94776-1_15},
  url = {https://doi.org/10.1007/978-3-319-94776-1_15},
  researchr = {https://researchr.org/publication/GoreckiME18},
  cites = {0},
  citedby = {0},
  pages = {168-179},
  booktitle = {Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings},
  editor = {Lusheng Wang and Daming Zhu},
  volume = {10976},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-94776-1},
}