Algorithm 1.
Iterative Matrix Completion
Input : Noisy incomplete Matrix X, Rank Estimate S | |
1: | Initialize Ainit ∈ ℝN×S and Binit ∈ ℝS×V with sign corrected SVD. |
2: | e ← Error rate |
3: | k ← S |
4: | while k ≥ 2 and MEC Score decreases do |
5: | Best ← RealMatCom(Ainit, Binit, X, k) |
6: | Aest, Best ← DiscreteMatCom(Best, X, e) |
7: | Choose the best segment based on individual scores |
8: | Ainit ← Aest |
9: | Binit ← Best |
10: | k ← k − 1 |
11: | end while |
Output : Estimated Haplotypes Best |