From Genome Analysis Wiki
Jump to navigationJump to search
109 bytes removed
, 17:27, 12 July 2013
Line 31: |
Line 31: |
| The algorithm to normalize a variant; biallelic or multiallelic is as follows: | | The algorithm to normalize a variant; biallelic or multiallelic is as follows: |
| | | |
− | [[Image:variant_normalization_algorithm.png|none|500px|Lines 1 to 3 ensures parsimonious representation on the left side. Lines 4 to 9 performs the left alignment and ensures parsimonious representation on the right side. Although we refer to this as a left alignment, this algorithm also ensures a parsimonious representation of Indels. In the case of STRs, we might prefer the repeat units be retained.]] | + | [[Image:variant_normalization_algorithm.png|none|600px|Lines 1 to 8 performs the left alignment and ensures parsimonious representation on the right side. Lines 9 to 11 ensures parsimonious representation on the left side. In the case of STRs, we might prefer the repeat units be retained.]] |
| | | |
− | Lines 1 to 3 ensures parsimonious representation on the left side. Lines 4 to 9 performs the left alignment and ensures parsimonious representation on the right side. In the case of STRs, we might prefer the repeat units be retained.
| |
| | | |
| + | Lines 1 to 8 performs the left alignment and ensures parsimonious representation on the right side. Lines 9 to 11 ensures parsimonious representation on the left side. In the case of STRs, we might prefer the repeat units be retained. |
| === Maintained by === | | === Maintained by === |
| | | |
| This page is maintained by [mailto:atks@umich.edu Adrian]. | | This page is maintained by [mailto:atks@umich.edu Adrian]. |