Skip to main content
. Author manuscript; available in PMC: 2018 May 1.
Published in final edited form as: Res Comput Mol Biol. 2017 Apr 12;10229:117–133. doi: 10.1007/978-3-319-56970-3_8

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: kS
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: AinitAest
9: BinitBest
10: kk − 1
11: end while
Output : Estimated Haplotypes Best