Complexity of computing distances between geometric trees

Feragen, A

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Complexity of computing distances between geometric trees

MPS-Authors

/persons/resource/persons85539

Feragen, A
Research Group Machine Learning and Computational Biology, Max Planck Institute for Intelligent Systems, Max Planck Society;

External Resource

No external resources are shared

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

Feragen, A. (2012). Complexity of computing distances between geometric trees. In G. Gimel´farb, E. Hancock, A. Imiya, A. Kuijper, M. Kudo, S. Omachi, et al. (Eds.), Structural, Syntactic, and Statistical Pattern Recognition. Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000E-FE0B-3

Abstract

There is no abstract available