𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm to find agreement subtrees

✍ Scribed by Ewa Kubicka; Grzegorz Kubicki; F. R. McMorris

Book ID
105115967
Publisher
Springer
Year
1995
Tongue
English
Weight
339 KB
Volume
12
Category
Article
ISSN
0176-4268

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm to find polygon similarity
An algorithm to find polygon similarity
✍ Jayaramaiah Boreddy; R.N. Mukherjee πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 191 KB
An improved bound on the maximum agreeme
An improved bound on the maximum agreement subtree problem
✍ Mike Steel; LΓ‘szlΓ³ A. SzΓ©kely πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 299 KB

We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same β‰₯ c log log n leaves which are homeomorphic, such that homeomorphism is identity on the leaves.

An algorithm to find a coordinate’s mate
An algorithm to find a coordinate’s mate
✍ Joost Berson; Arno van den Essen πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 175 KB

In this paper an algorithm is given to decide if a given polynomial in two variables with coefficients in a finitely generated K -algebra is a coordinate and if so, find a mate for this polynomial.