Skip to main content
Search
Explore journals
Get published
About BMC
My account
Search all BMC articles
Search
Algorithms for Molecular Biology
Home
About
Articles
Submission Guidelines
Table 4 The costs of relevant edges in the auxiliary graph for computing the value of
\(G'(c, ab)\)
: note that the cost for the edge (
u
,
v
) is exactly value of
G
(
u
,
v
), the size of the maximum common subtree between
\(T_{1}(u)\)
and
\(T_{2}(v)\)
From:
A multi-labeled tree dissimilarity measure for comparing “clonal trees” of tumor progression
G
{cde}
{f}
{g}
{de}
2
0
0
{f}
0
1
0
Back to article page