Browsing Computer Science by Author "Benson, Gary"

OpenBU

Browsing Computer Science by Author "Benson, Gary"

Sort by: Order: Results:

  • Andken, Benjamin B; Lim, In; Benson, Gary; Vincent, John J; Ferenc, Matthew T; Heinrich, Bianca; Jarzylo, Larissa A; Man, Heng-Ye; Deshler, James O (BioMed Central, 2007-7-30)
    BACKGROUND. Short (~5 nucleotides) interspersed repeats regulate several aspects of post-transcriptional gene expression. Previously we developed an algorithm (REPFIND) that assigns P-values to all repeated motifs in a ...
  • Papapetrou, Panagiotis; Benson, Gary; Kollios, George (Boston University Computer Science Department, 2006-10-15)
    The problem of discovering frequent arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence is studied, and two efficient approaches are proposed to solve it. The first approach ...
  • Giordano, Joti; Ge, Yongchao; Gelfand, Yevgeniy; Abrusán, György; Benson, Gary; Warburton, Peter E (Public Library of Science, 2007-7-13)
    The constant bombardment of mammalian genomes by transposable elements (TEs) has resulted in TEs comprising at least 45% of the human genome. Because of their great age and abundance, TEs are important in comparative ...
  • Papapetrou, Panagiotis; Benson, Gary; Kollios, George (Boston University Computer Science Department, 2008-10-21)
    The problem of discovering frequent poly-regions (i.e. regions of high occurrence of a set of items or patterns of a given alphabet) in a sequence is studied, and three efficient approaches are proposed to solve it. The ...
  • Gelfand, Yevgeniy; Rodriguez, Alfredo; Benson, Gary (Oxford University Press, 2006-12-14)
    Tandem repeats in DNA have been under intensive study for many years, first, as a consequence of their usefulness as genomic markers and DNA fingerprints and more recently as their role in human disease and regulatory ...

Search OpenBU


Advanced Search

Browse

Deposit Materials