A consistent distance matrixD on a collection of taxas1,s2,…,sn is consistent if
there exists a tree T that models the evolutionary relationships encoded by the
distances in D.
More precisely, for D to achieve consistency, we demand that T is a weighted,
unrooted binary tree, and that the distance between sj and sk in T is equal to Dj,k.
Report a typo
Page:
Context:
Flag as inappropriate
Are you sure you want to flag this comment as inappropriate?
Welcome to Rosalind!
Rosalind is a platform for learning bioinformatics through problem solving.
Please login with Google/Twitter/Facebook or
register a new account.