Reconstructing a history of recombinations from a set of sequences
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Haplotyping as perfect phylogeny: conceptual framework and efficient solutions
Proceedings of the sixth annual international conference on Computational biology
Sequence Database Search Using Jumping Alignments
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Algorithms for Association Study Design Using a Generalized Model of Haplotype Conservation
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Combinatorial problems arising in SNP and haplotype analysis
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
A Class Representative Model for Pure Parsimony Haplotyping
INFORMS Journal on Computing
Bounds on the minimum mosaic of population sequences under recombination
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Large neighbourhood search algorithms for the founder sequence reconstruction problem
Computers and Operations Research
A hidden markov technique for haplotype reconstruction
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Haplotype inference via hierarchical genotype parsing
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Improved algorithms for inferring the minimum mosaic of a set of recombinants
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
Recent evidence for a "blocky" haplotype structure to the human genome and for its importance to disease inference studies has created a pressing need for tools that identify patterns of past recombination in sequences of samples of human genes and gene regions. We present two new approaches to the reconstruction of likely recombination patterns from a set of haploid sequences which each combine combinatorial optimization techniques with statistically motivated recombination models. The first breaks the problem into two discrete steps: finding recombination sites then coloring sequences to signify the likely ancestry of each segment. The second poses the problem as optimizing a single probability function for parsing a sequence in terms of ancestral haplotypes. We explain the motivation for each method, present algorithms, show their correctness, and analyze their complexity. We illustrate and analyze the methods with results on real, contrived, and simulated datasets.