Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Certifying inconsistency of sparse linear systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Haplotyping as perfect phylogeny: conceptual framework and efficient solutions
Proceedings of the sixth annual international conference on Computational biology
Large scale reconstruction of haplotypes from genotype data
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Efficient rule-based haplotyping algorithms for pedigree data
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Solving Large Sparse Linear Systems over Finite Fields
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Linear-Time haplotype inference on pedigrees without recombinations
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Complexity and approximation of the minimum recombination haplotype configuration problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
k-Recombination haplotype inference in pedigrees
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Highly Scalable Genotype Phasing by Entropy Minimization
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Natural Computing: an international journal
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Haplotype reconstruction in large pedigrees with many untyped individuals
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Mutation Region Detection for Closely Related Individuals without a Known Pedigree
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Solving haplotype inference problem with non-genotyped founders via integer linear programming
Journal of Combinatorial Optimization
Fixed-parameter algorithm for general pedigrees with a single pair of sites
ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications
The parameterized complexity of the shared center problem
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Hi-index | 0.00 |
Computational inference of haplotypes from genotypes has attracted a great deal of attention in the computational biology community recently, partially driven by the international HapMap project. In this paper, we study the question of how to efficiently infer haplotypes from genotypes of individuals related by a pedigree, assuming that the hereditary process was free of mutations (i.e. the Mendelian law of inheritance) and recombinants. The problem has recently been formulated as a system of linear equations over the finite field of F(2) and solved in O(m3n3) time by using standard Gaussian elimination, where m is the number of loci (or markers) in a genotype and n the number of individuals in the pedigree. We give a much faster algorithm with running time O(mn2 + n3 log2 n log log n). The key ingredients of our construction are (i) a new system of linear equations based on some spanning tree of the pedigree graph and (ii) an efficient method for eliminating redundant equations in a system of O(mn) linear equations over O(n) variables. Although such a fast elimination method is not known for general systems of linear equations, we take advantage of the underlying pedigree graph structure and recent progress on low-stretch spanning trees.