Abstract
The study of variation in DNA sequences, within the framework of phylogeny or population genetics, for instance, is one of the most important subjects in modern genomics. We here present a new linear-time algorithm for finding maximal k-regions in alignments of three sequences, which can be used for the detection of segments featuring a certain degree of similarity, as well as the boundaries of distinct genomic environments such as gene clusters or haplotype blocks. k-regions are defined as these which have a center sequence whose Hamming distance from any of the alignment rows is at most k, and their determination in the general case is known to be NP-hard.
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.
References
Crawford, D.C., Nickerson, D.A.: Definition and clinical importance of haplotypes. Ann. Rev. Med. 56, 303–320 (2005)
Balhoff, J.P., Wray, G.A.: Evolutionary analysis of the well characterized endo16 promoter reveals substantial variation within functional sites. PNAS 102, 8591–8596 (2005)
Frances, M., Litman, A.: On covering problems of codes. Theory of Computing Systems 30, 113–119 (1997)
Hinrichs, A.S., Karolchik, D., Baertsch, R., et al.: The UCSC Genome Browser Database: update 2006. Nucleic Acids Res. 34, D590–D598 (2006)
Lee, A.P., Koh, E.G., Tay, A., Brenner, S., Venkatesh, B.: Highly conserved syntenic blocks at the vertebrate Hox loci and conserved regulatory elements within and outside Hox gene clusters. PNAS 103, 6994–6999 (2006)
Li, M., Ma, B., Wang, L.: Finding Similar Regions in Many Strings. In: Proc. of the 31st ACM Symp. on Theory of Computing STOC 1999, pp. 473–482. ACM Press, New York (1999)
Li, M., Ma, B., Wang, L.: On the Closest String and Substring Problems. J. ACM 49, 157–171 (2002)
Stojanovic, N., Berman, P., Gumucio, D., Hardison, R., Miller, W.: A linear–time algorithm for the 1–mismatch problem. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 126–135. Springer, Heidelberg (1997)
Stojanovic, N., Dewar, K.: A Probabilistic Approach to the Assessment of Phylogenetic Conservation in Mammalian Hox Gene Clusters. In: Proc. BIOINFO 2005, Int’l Joint Conf. of InCoB, AASBi and KSBI, pp. 118–123 (2005)
The ENCODE Project Consortium. The ENCODE (ENCyclopedia Of DNA Elements) Project. Science 306, 636–640 (2004)
The International HapMap Consortium. A haplotype map of the human genome. Nature 437, 1299–1320 (2005)
The International SNP Map Working Group. A map of human genome sequence variation containing 1.42 million single nucleotide polymorphisms. Nature 409, 928–933 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stojanovic, N., Berman, P. (2006). A Linear-Time Algorithm for Studying Genetic Variation. In: Bücher, P., Moret, B.M.E. (eds) Algorithms in Bioinformatics. WABI 2006. Lecture Notes in Computer Science(), vol 4175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11851561_32
Download citation
DOI: https://doi.org/10.1007/11851561_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39583-6
Online ISBN: 978-3-540-39584-3
eBook Packages: Computer ScienceComputer Science (R0)