Description Usage Arguments Details Value References See Also Examples
This function orders the SNVs in the window around the SNV.
1 | orderSNVs(snvWin)
|
snvWin |
See the arguments in |
Following Gusfield (1991), the first step in building the dendogram is to order compatible SNVs by their ancestry. Then, following Mailund et al. (2006) the incompatible SNVs are ordered according to their proximity to the focal SNV.
A hapMat with ordered SNVs.
Gusfield, D. (1991). Efficient algorithms for inferring evolutionary trees. Networks, 21(1), 19-28.
Mailund, T., Besenbacher, S., & Schierup, M. H. (2006). Whole genome association mapping by incompatibilities and local perfect phylogenies. BMC Bioinformatics, 7(1), 454.
1 |
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.