On the Complexity of Computing Evolutionary Trees

Gasieniec, Leszek; Jansson, Jesper; Lingas, Andrzej; Östlin, Anna

doi:10.1007/BFb0045080

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On the Complexity of Computing Evolutionary Trees

MPS-Authors

/persons/resource/persons44478

Gasieniec, Leszek
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dwoM2
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Gasieniec, L., Jansson, J., Lingas, A., & Östlin, A. (1997). On the Complexity of Computing Evolutionary Trees. In T. Jiang, & D. T. Lee (Eds.), Computing and Combinatorics (pp. 134-145). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-3960-7

Abstract

There is no abstract available