0
$\begingroup$

Is there any method for constructing a phylogenetic tree from a distance matrix which is not symmetric (i.e. the distance from A to be is not the same as the distance from B to A)? The distances I have in mind (too complicated to explain here) roughly tells us how difficult it is to go evolve A to B.

$\endgroup$
  • 2
    $\begingroup$ To my knowledge, there exist no such method. Without explaining further your metric distance, it might be hard to give further thinking and suggestion about what could be done. A priori, I would say just to consider the average distance between any pairs of species (to make you distance matrix symmetric) and then you can just run your NJ algorithm or whichever other algorithm. $\endgroup$ – Remi.b Feb 13 at 18:51

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.