Computing maximum agreement forests without cluster partitioning is folly

Zhijiang Li, Norbert Zeh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish
Title of host publication25th European Symposium on Algorithms, ESA 2017
EditorsChristian Sohler, Christian Sohler, Kirk Pruhs
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770491
DOIs
Publication statusPublished - Sept 1 2017
Event25th European Symposium on Algorithms, ESA 2017 - Vienna, Austria
Duration: Sept 4 2017Sept 6 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume87
ISSN (Print)1868-8969

Conference

Conference25th European Symposium on Algorithms, ESA 2017
Country/TerritoryAustria
CityVienna
Period9/4/179/6/17

ASJC Scopus Subject Areas

  • Software

Fingerprint

Dive into the research topics of 'Computing maximum agreement forests without cluster partitioning is folly'. Together they form a unique fingerprint.

Cite this