scientific article
From MaRDI portal
Publication:3128909
zbMath0869.92013MaRDI QIDQ3128909
Publication date: 14 August 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Problems related to evolution (92D15) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)
Related Items
Computing the unrooted maximum agreement subtree in sub-quadratic time, An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees, On the agreement of many trees, Computing the agreement of trees with bounded degrees, Improved algorithms for maximum agreement and compatible supertrees, On the parameterized complexity of the multi-MCT and multi-MCST problems, Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees, From constrained to unconstrained maximum agreement subtree in linear time, A survey on tree edit distance and related problems, Computing the maximum agreement of phylogenetic networks, On the complexity of comparing evolutionary trees
