| Project | Rearrangements in genomes with unequal content |
|---|---|
| Date | 27/01/05 |
| Version | 1.0 |
| Purpose of Meeting | Discuss experimental results |
| Supervisor present | Leong Hon Wai |
Results of the comparison of the percentage of correct edges shows that
Results of the comparison of the accurary of the recovered scenario by comparing the normalized reversal distance between the recovered root and the identity
mgr_uc performs better in terms of the recovered scenario while mgr_uc_2 performs better in terms of the percentage of correct edges. Therefore one way to combine both approaches is to set a threshold value for mgr_uc, when the score of the best rearrangement falls below the threshold, switch to the method of mgr_uc_2. Prof Leong suggested that we can plot a graph of the score of the best rearrangement and use it to determine a good threshold value.
Prof Leong suggest that we compute the number of rearrangements determined during the “good” rearrangements phase as well as the number of rearrangments determined during the iterative median phase of the MGR algorithm. This will be able to help us understand the behaviour of the MGR algorithm.
Prof Leong pointed out that the iterative median method used in the MGR algorithm is very similar to the NJ method.
Instead of using a fixed k for the number of rearrangement/edge in the model tree, perhaps this can be varied
None