title: Refined repetitive sequence searches utilizing a fast hash function and cross species information retrievals.
abstract: BACKGROUND
  Searching for small tandem/disperse repetitive DNA sequences streamlines many biomedical research processes. For instance, whole genomic array analysis in yeast has revealed 22 PHO-regulated genes. The promoter regions of all but one of them contain at least one of the two core Pho4p binding sites, CACGTG and CACGTT. In humans, microsatellites play a role in a number of rare neurodegenerative diseases such as spinocerebellar ataxia type 1 (SCA1). SCA1 is a hereditary neurodegenerative disease caused by an expanded CAG repeat in the coding sequence of the gene. In bacterial pathogens, microsatellites are proposed to regulate expression of some virulence factors. For example, bacteria commonly generate intra-strain diversity through phase variation which is strongly associated with virulence determinants. A recent analysis of the complete sequences of the Helicobacter pylori strains 26695 and J99 has identified 46 putative phase-variable genes among the two genomes through their association with homopolymeric tracts and dinucleotide repeats. Life scientists are increasingly interested in studying the function of small sequences of DNA. However, current search algorithms often generate thousands of matches -- most of which are irrelevant to the researcher.
  
  
  RESULTS
  We present our hash function as well as our search algorithm to locate small sequences of DNA within multiple genomes. Our system applies information retrieval algorithms to discover knowledge of cross-species conservation of repeat sequences. We discuss our incorporation of the Gene Ontology (GO) database into these algorithms. We conduct an exhaustive time analysis of our system for various repetitive sequence lengths. For instance, a search for eight bases of sequence within 3.224 GBases on 49 different chromosomes takes 1.147 seconds on average. To illustrate the relevance of the search results, we conduct a search with and without added annotation terms for the yeast Pho4p binding sites, CACGTG and CACGTT. Also, a cross-species search is presented to illustrate how potential hidden correlations in genomic data can be quickly discerned. The findings in one species are used as a catalyst to discover something new in another species. These experiments also demonstrate that our system performs well while searching multiple genomes -- without the main memory constraints present in other systems.
  
  
  CONCLUSIONS
  We present a time-efficient algorithm to locate small segments of DNA and concurrently to search the annotation data accompanying the sequence. Genome-wide searches for short sequences often return hundreds of hits. Our experiments show that subsequently searching the annotation data can refine and focus the results for the user. Our algorithms are also space-efficient in terms of main memory requirements. Source code is available upon request.
authors.affiliation: Department of Computer Science, University of Missouri, Columbia, USA. jeff@diglib1.cecs.missouri.edu
authors.forename: Jeff
authors.initials: J
authors.lastname: Reneker
authors.forename: Chi-Ren
authors.initials: CR
authors.lastname: Shyu
mesh_terms: D000465:Algorithms; D000818:Animals; D001483:Base Sequence; D019295:Computational Biology / Q000379:methods*; D003628:Database Management Systems; D016208:Databases, Factual; D030541:Databases, Genetic; D020869:Gene Expression Profiling; D016678:Genome; D006193:Haemophilus influenzae / Q000235:genetics; D016480:Helicobacter pylori / Q000235:genetics; D006801:Humans; D016247:Information Storage and Retrieval; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D011381:Programming Languages; D011401:Promoter Regions, Genetic; D012091:Repetitive Sequences, Nucleic Acid; D016415:Sequence Alignment; D017422:Sequence Analysis, DNA; D012984:Software; D013045:Species Specificity; D014584:User-Computer Interface