Figure - PMC

Skip to main content

An official website of the United States government

Here's how you know

Here's how you know

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

View full-text article in PMC

. 2005 Apr 8;6:92. doi: 10.1186/1471-2105-6-92

Search in PMC
Search in PubMed
View in NLM Catalog
Add to search

Copyright © 2005 Sy Vinh and von Haeseler; licensee BioMed Central Ltd.

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PMC Copyright notice

we select only min(k, |S_i|) and min(k, |S_j|) closest leaves to the root of T_iand T_jwith respect to the path length, respectively, i.e. for k = 3 we pick {1, 2} from and {4, 5, 6} from . The leaf set {1, 2} (or {4, 5, 6}) is the 3-representative leaf set of the rooted subtree . (or ).

Inline graphic — we select only min(k, |S_i|) and min(k, |S_j|) closest leaves to the root of T_iand T_jwith respect to the path length, respectively, i.e. for k = 3 we pick {1, 2} from and {4, 5, 6} from . The leaf set {1, 2} (or {4, 5, 6}) is the 3-representative leaf set of the rooted subtree . (or ).