text: user3142: I have been working on nucleotide and protein data to reconstruct maximum parsimony trees using MEGA software to get parsimony tree, via "random addition" method is used to generate the initial tree(s).
  I need to know that when randomly chosen sequences are added to reconstruct an initial tree, on what basis the best tree is chosen??
  I would appreciate if anyone can guide me about this method or suggest me some good literature about this in order to make me understand the concept of this method.
  
  user3460: MEGA manual may help to explain the criteria used in selecting the final maximum parsimony tree. 
  The random tree additions refers to the generation of random initial trees for a heuristic search to find MP trees. In this case, a tree is generated by randomly selecting a sequence and adding it to the growing tree on a randomly-selected branch.
  Instead of using the random tree additions you can use the min-mini algorithm for the initial tree set. 
  
original_text: 3142: <p>I have been working on nucleotide and protein data to reconstruct maximum parsimony trees using MEGA software to get parsimony tree, via "random addition" method is used to generate the initial tree(s).</p>
  
  <p>I need to know that when randomly chosen sequences are added to reconstruct an initial tree, on what basis the best tree is chosen??</p>
  
  <p>I would appreciate if anyone can guide me about this method or suggest me some good literature about this in order to make me understand the concept of this method.</p>
   3460: <p><a href="https://www.megasoftware.net/mega4/WebHelp/hc_maximum_parsimony.htm" rel="nofollow noreferrer">MEGA manual</a> may help to explain the criteria used in selecting the final maximum parsimony tree. </p>
  
  <p>The random tree additions refers to the generation of random initial trees for a heuristic search to find MP trees. In this case, a tree is generated by randomly selecting a sequence and adding it to the growing tree on a randomly-selected branch.</p>
  
  <p>Instead of using the random tree additions you can use the min-mini algorithm for the initial tree set. </p>
  