Mutation Region Detection for Closely Related Individuals without a Known Pedigree

Authors:
Wenji Ma;Yong Yang;Zhi-Zhong Chen;Lusheng Wang
Affiliations:
City University of Hong Kong, Hong Kong;City University of Hong Kong, Hong Kong;Tokyo Denki University, Tokyo;City University of Hong Kong, Hong Kong
Venue:
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Year:
2012

Citing 4
Cited 1

An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
HAPLORE: a program for haplotype reconstruction in general pedigrees without recombination

Bioinformatics
Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Identification of linked regions using high-density SNP genotype data in linkage analysis

Bioinformatics

The parameterized complexity of the shared center problem

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linkage analysis serves as a way of finding locations of genes that cause genetic diseases. Linkage studies have facilitated the identification of several hundreds of human genes that can harbor mutations which by themselves lead to a disease phenotype. The fundamental problem in linkage analysis is to identify regions whose allele is shared by all or almost all affected members but by none or few unaffected members. Almost all the existing methods for linkage analysis are for families with clearly given pedigrees. Little work has been done for the case where the sampled individuals are closely related, but their pedigree is not known. This situation occurs very often when the individuals share a common ancestor at least six generations ago. Solving this case will tremendously extend the use of linkage analysis for finding genes that cause genetic diseases. In this paper, we propose a mathematical model (the shared center problem) for inferring the allele-sharing status of a given set of individuals using a database of confirmed haplotypes as reference. We show the NP-completeness of the shared center problem and present a ratio-2 polynomial-time approximation algorithm for its minimization version (called the closest shared center problem). We then convert the approximation algorithm into a heuristic algorithm for the shared center problem. Based on this heuristic, we finally design a heuristic algorithm for mutation region detection. We further implement the algorithms to obtain a software package. Our experimental data show that the software is both fast and accurate. The package is available at http://www.cs.cityu.edu.hk/~lwang/software/LDWP/ for noncommercial use.