Answers.Body: <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>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2018-10-07T12:45:49.543Z
Answers.Text: Thankyou for the response, but the thing is that I need to understand how can an initial tree be constructed to be used for heuristic searches to find parsimonious tree?
Answers.UserDisplayName: Sidra Younas
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2018-10-05T22:01:29.783Z
Answers.LastActivityDate: 2018-10-06T11:45:43.670Z
Answers.LastEditDate: 2018-10-06T11:45:43.670Z
Answers.UserDisplayName: Daisetsu
Body: <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>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2018-09-19T02:10:33.117Z
Comments.Text: Is there something wrong with question?
Comments.UserDisplayName: Sidra Younas
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2018-09-19T07:19:00.400Z
Comments.Text: Nothing is wrong with this question, but people do this on their own time and are not working to solve other's problems, and some might not be on the same time-zone as you. Did you try reading the [original article](https://doi.org/10.1093/bioinformatics/10.2.189) ?
Comments.UserDisplayName: llrs
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2018-09-25T01:18:13.410Z
Comments.Text: Yes, I have gone through it but it did'nt help me solving my question.
Comments.UserDisplayName: Sidra Younas
Tags: <phylogenetics><phylogeny>
Title: Random addition method for phylogenetic tree reconstruction
ThreadText: # Random addition method for phylogenetic tree reconstruction
  
  (Asked by: username_0 on 2018-09-18)
  
  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.
  
  **Tags:** phylogenetics, phylogeny
  
  > **Comments:**
  > **username_0**: Is there something wrong with question?  
  > **username_1**: Nothing is wrong with this question, but people do this on their own time and are not working to solve other's problems, and some might not be on the same time-zone as you. Did you try reading the [original article](https://doi.org/10.1093/bioinformatics/10.2.189) ?  
  > **username_0**: Yes, I have gone through it but it did'nt help me solving my question.  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_2 on 2018-10-05. Score: 2
  
  [MEGA manual](https://www.megasoftware.net/mega4/WebHelp/hc_maximum_parsimony.htm) 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.
  
  > **Comments:**
  > **username_0**: Thankyou for the response, but the thing is that I need to understand how can an initial tree be constructed to be used for heuristic searches to find parsimonious tree?  
  
  ---
  
  