Parsimony score of a NJ tree
1
0
Entering edit mode
5.4 years ago
mdsiddra ▴ 30

I have been working in evolutionary genomics field and hence reconstructing the phylogenetic trees using nucleotide/protein sequence data. I need to ask can a calculation of parsimony score be done for a Neighbor-joining or UPGMA tree to find that topolgy of the tree which represents the minimum evolutionary changes???

Phylogenetics • 2.1k views
ADD COMMENT
0
Entering edit mode
5.4 years ago

NJ and UPGMA are distance matrix-based methods. So if you only have the resulting tree obtained by these methods and don't have the sequences, than you can not perform parsimony calculations.

ADD COMMENT
0
Entering edit mode

Lets say we have a particular set of sequences, and a NJ / UPGMA tree for this data too. Can this tree be used as an initial tree topology for parsimony score calculation to result a tree that has minimum evolutionary changes?

ADD REPLY
0
Entering edit mode

I am not aware of any method/software for doing that, but the problem I see is that the NJ tree topology might not coincide with the real maximum parsimony tree. Why not just to reconstruct the parsimony tree if you have sequences?

ADD REPLY
0
Entering edit mode

As small parsimony problem states that it works with 'n' number of sequences and an initial tree topology and then uses the heuristic searches (NNI, SPR, etc) and calculates the parsimony score resulting the tree with an arrangement of least score. Moreover, as suggested that Neighbor joining is just a clustering algorithm that clusters haplotypes based on genetic distance, using this as basis, In this scenario can a tree topology reconstructed using NJ method be used as an initial tree topology for MP method?

ADD REPLY
0
Entering edit mode

Yes I know what you mean, but I don't know if this option exists in MP software. You can have a look in the documentation of the software that you are using (I guess PAUP).

ADD REPLY

Login before adding your answer.

Traffic: 3803 users visited in the last hour
Help About
FAQ
Access RSS
API
Stats

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.

Powered by the version 2.3.6