scientific article; zbMATH DE number 432794
From MaRDI portal
Publication:3138927
zbMATH Open0800.68618MaRDI QIDQ3138927FDOQ3138927
Authors: Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow 
Publication date: 20 September 1994
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Developmental biology, pattern formation (92C15)
Cited In (4)
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
- An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree
- A robust model for finding optimal evolutionary tree
- Reconstruction of rooted trees from subtrees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138927)
