Abstract
Recombination plays an important role in shaping the genetic variations present in current-day populations. We consider populations evolved from a small number of founders, where each individual’s genomic sequence is composed of segments from the founders. We study the problem of segmenting the genotype sequences into the minimum number of segments attributable to the founder sequences. The minimum segmentation can be used for inferring the relationship among sequences to identify the genetic basis of traits, which is important for disease association studies. We propose two dynamic programming algorithms which can solve the minimum segmentation problem in polynomial time. Our algorithms incorporate biological constraints to greatly reduce the computation, and guarantee that only minimum segmentation solutions with comparable numbers of segments on both haplotypes of the genotype sequence are computed. Our algorithms can also work on noisy data including genotyping errors, point mutations, gene conversions, and missing values.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Churchill, G.A., et al.: The Collaborative Cross, a community resource for the genetic analysis of complex traits. Nat. Genet. 36, 1133–1137 (2002)
Dally, M., Rioux, J., Schaffner, S.F., Hudson, T., Lander, E.: High-resolution haplotype structure in the human genome. Nat. Genet. 29, 229–232 (2001)
Gusfield, D.: Haplotyping as perfect phylogeny: conceptual framework and efficient solutions. In: RECOMB, pp. 166–175 (2002)
Gusfield, D., Eddhu, S., Langley, C.: Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinf. Comput. Biol. 2, 173–213 (2004)
Gabriel, S.B., Schaffner, S.F., Nguyen, H., Moore, et al.: The structure of haplotype blocks in the human genome. Science 296, 2225–2229 (2002)
Schwartz, R., Halldorson, B.V., Bafna, V., Clark, A.G., Istrail, S.: Robustness of inference of haplotyp block structure. J. Comput. Biol. 10, 13–19 (2003)
Threadgill, D.W., Hunter, K.W., Williams, R.W.: Genetic dissection of complex and quantitative traits: from fantasy to reality via a community effort. Mamm Genome 13, 175–178 (2002)
Ukkonen, E.: Finding founder sequences from a set of recombinants. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 277–286. Springer, Heidelberg (2002)
Valdar, W., Flint, J., Mott, R.: Simulating the Collaborative Cross: Power of Quantitative Trait Loci Detection and Mapping Resolution in Large Sets of Recombinant Inbred Strains of Mice. Genetics 172(3), 1783–1797 (2006)
Wu, Y., Gusfield, D.: Improved algorithms for inferring the minimum mosaic of a set of recombinants. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 150–161. Springer, Heidelberg (2007)
Zhang, Q., Wang, W., McMillan, L., Prins, J., Villena, F.P., Threadgill, D.: Genotype Sequence Segmentation: Handling Constraints and Noise. UNC Tech. Report (2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Q., Wang, W., McMillan, L., Prins, J., Pardo-Manuel de Villena, F., Threadgill, D. (2008). Genotype Sequence Segmentation: Handling Constraints and Noise. In: Crandall, K.A., Lagergren, J. (eds) Algorithms in Bioinformatics. WABI 2008. Lecture Notes in Computer Science(), vol 5251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87361-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-87361-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87360-0
Online ISBN: 978-3-540-87361-7
eBook Packages: Computer ScienceComputer Science (R0)