An improved bound on the Maximum Agreement Subtree problem

Details An improved bound on the Maximum Agreement Subtree problem An improved bound on the Maximum Agreement Subtree problem

2009-03-19

arxiv.org/abs/0903.3386v1

Biology

Quantitative Biology

Populations and Evolution

5 pages, 1 figure

Scientific paper

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 $\geq c\log\log n$ leaves which are homeomorphic,
such that homeomorphism is identity on the leaves.

Affiliated with

Also associated with

No associations

Rating

An improved bound on the Maximum Agreement Subtree problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An improved bound on the Maximum Agreement Subtree problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An improved bound on the Maximum Agreement Subtree problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-648878