Fast and cheap genome wide haplotype construction via optical mapping.
We describe an efficient algorithm to construct genome wide haplotype restriction maps of an individual by aligning single molecule DNA fragments collected with Optical Mapping technology. Using this algorithm and small amount of genomic material, we can construct the parental haplotypes for each diploid chromosome for any individual. Since such haplotype maps reveal the polymorphisms due to single nucleotide differences (SNPs) and small insertions and deletions (RFLPs), they are useful in association studies, studies involving genomic instabilities in cancer, and genetics, and yet incur relatively low cost and provide high throughput. If the underlying problem is formulated as a combinatorial optimization problem, it can be shown to be NP-complete (a special case of K-population problem). But by effectively exploiting the structure of the underlying error processes and using a novel analog of the Baum-Welch algorithm for HMM models, we devise a probabilistic algorithm with a time complexity that is linear in the number of markers for an epsilon-approximate solution. The algorithms were tested by constructing the first genome wide haplotype restriction map of the microbe T. pseudoana, as well as constructing a haplotype restriction map of a 120 Mb region of Human chromosome 4. The frequency of false positives and false negatives was estimated using simulated data. The empirical results were found very promising.
Anantharaman
T S
TS
Wisconsin Biotech Center, Univ Wisc, Madison, WI, USA. tsa@biostat.wisc.edu
Mysore
V
V
Mishra
B
B
D000465:Algorithms; D002874:Chromosome Mapping / Q000379:methods*; D004247:DNA / Q000235:genetics; D016678:Genome; D006239:Haplotypes; D008957:Models, Genetic; D012150:Polymorphism, Restriction Fragment Length; D020641:Polymorphism, Single Nucleotide; D015183:Restriction Mapping; D016415:Sequence Alignment; D017384:Sequence Deletion
D004247:DNA