A Linear-Time Algorithm for Studying Genetic Variation

  • Nikola Stojanovic
  • Piotr Berman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4175)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Crawford, D.C., Nickerson, D.A.: Definition and clinical importance of haplotypes. Ann. Rev. Med. 56, 303–320 (2005)CrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Frances, M., Litman, A.: On covering problems of codes. Theory of Computing Systems 30, 113–119 (1997)MATHMathSciNetGoogle Scholar
  4. 4.
    Hinrichs, A.S., Karolchik, D., Baertsch, R., et al.: The UCSC Genome Browser Database: update 2006. Nucleic Acids Res. 34, D590–D598 (2006)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Li, M., Ma, B., Wang, L.: On the Closest String and Substring Problems. J. ACM 49, 157–171 (2002)CrossRefMathSciNetGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    The ENCODE Project Consortium. The ENCODE (ENCyclopedia Of DNA Elements) Project. Science 306, 636–640 (2004)Google Scholar
  11. 11.
    The International HapMap Consortium. A haplotype map of the human genome. Nature 437, 1299–1320 (2005)Google Scholar
  12. 12.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Nikola Stojanovic
    • 1
  • Piotr Berman
    • 2
  1. 1.Department of Computer Science and EngineeringThe University of Texas at ArlingtonArlingtonUSA
  2. 2.Department of Computer Science and EngineeringThe Pennsylvania State UniversityUniversity ParkUSA

Personalised recommendations