Branding/Logomark minus Citation Combined Shape Icon/Bookmark-empty Icon/Copy Icon/Collection Icon/Close Copy 7 no author result Created with Sketch. Icon/Back Created with Sketch.
Loading Scinapse...
  • References (8)
  • Cited By (0)
References8
Published on Aug 1, 2001in Genome Biology 13.21
Natalia Volfovsky15
Estimated H-index: 15
,
Brian J. Haas64
Estimated H-index: 64
,
Steven L. Salzberg118
Estimated H-index: 118
Background A computational system for analysis of the repetitive structure of genomic sequences is described. The method uses suffix trees to organize and search the input sequences; this data structure has been used previously for efficient computation of exact and degenerate repeats.
118 Citations Source Cite
Published on Sep 9, 1991
Petteri Jokinen2
Estimated H-index: 2
(University of Helsinki),
Esko Ukkonen40
Estimated H-index: 40
(University of Helsinki)
The problem of finding all approximate occurrences P′ of a pattern string P in a text string T such that the edit distance between P and P′ is ≤k is considered. We concentrate on a scheme in which T is first preprocessed to make the subsequent searches with different P fast. Two preprocessing methods and the corresponding search algorithms are described. The first is based suffix automata and is applicable for edit distances with general edit operation costs. The second is a special design for u...
140 Citations Source Cite
Published on Jun 1, 1995in The FASEB Journal 5.59
D Lohr1
Estimated H-index: 1
(Arizona State University),
P Venkov1
Estimated H-index: 1
(Arizona State University),
J Zlatanova1
Estimated H-index: 1
(Arizona State University)
Regulation of the GAL structural genes in the yeast Saccharomyces cerevisiae is implemented by the products of GAL-specific (GAL4, GAL80, GAL3) and general (GAL11, SWI1, 2, 3, SNF5, 6, numerous glucose repression) genes. Recent work has 1) yielded significant new insights on the DNA binding and transcription activation/Gal80 protein binding functions of the Gal4 activator protein, 2) described the characterization of purified Gal4 protein-Gal80 protein complexes, 3) deconvoluted the multiple and...
321 Citations Source Cite
Published on Jul 1, 2001in Nature Reviews Genetics 41.47
Lincoln Stein83
Estimated H-index: 83
(Cold Spring Harbor Laboratory)
The genome sequence of an organism is an information resource unlike any that biologists have previously had access to. But the value of the genome is only as good as its annotation. It is the annotation that bridges the gap from the sequence to the biology of the organism. The aim of high-quality annotation is to identify the key features of the genome - in particular, the genes and their products. The tools and resources for annotation are developing rapidly, and the scientific community is be...
247 Citations Source Cite
Published on Apr 1, 1985in Cell 31.40
Edward Giniger2
Estimated H-index: 2
(Harvard University),
Susan M. Varnum1
Estimated H-index: 1
(Harvard University),
Mark Ptashne78
Estimated H-index: 78
(Harvard University)
Abstract We show by the following series of experiments that the yeast positive regulatory protein GAL4 binds to four sites in the upstream activating sequence UAS G to activate transcription of the adjacent GAL1 and GAL10 genes. GAL4 protein expressed in E. coli protected guanine residues in UAS G from methylation by dimethyl sulfate. The same set of protections was seen in vivo in yeast and depended on the GAL4 + allele. This protection pattern is consistent with the idea that GAL4 protein bin...
467 Citations Source Cite
Published on May 1, 1999in Journal of the ACM 1.74
Gene Myers12
Estimated H-index: 12
(University of Arizona)
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k -or-fewer differences. Simple and practical bit-vector algorithms have been designed for this problem, most notably the one used in agrep . These algorithms compute a bit representation of the current state-set of the k -difference automaton for the query, and asymptotically run in either O ( nm/w ) or O ( nm log s/ w ) time where w is the word size of th...
293 Citations Source Cite
Published on Oct 1, 2001in Genome Research 10.10
Zemin Ning35
Estimated H-index: 35
(Wellcome Trust),
Anthony J. Cox18
Estimated H-index: 18
(Wellcome Trust),
James C. Mullikin26
Estimated H-index: 26
(Wellcome Trust)
We describe an algorithm, SSAHA (Sequence Search and Alignment by Hashing Algorithm), for performing fast searches on databases containing multiple gigabases of DNA. Sequences in the database are preprocessed by breaking them into consecutive k-tuples of k contiguous bases and then using a hash table to store the position of each occurrence of each k-tuple. Searching for a query sequence in the database is done by obtaining from the hash table the “hits” for each k-tuple in the query sequence an...
822 Citations Source Cite
Published on Oct 1, 2000in Bioinformatics 5.48
Pierre Baldi81
Estimated H-index: 81
,
Pierre-François Baisnée3
Estimated H-index: 3
Motivation: DNA structure plays an important role in a variety of biological processes. Different di- and trinucleotide scales have been proposed to capture various aspects of DNA structure including base stacking energy, propeller twist angle, protein deformability, bendability, and position preference. Yet, a general framework for the computational analysis and prediction of DNA structure is still lacking. Such a framework should in particular address the following issues: (1) construction of ...
43 Citations Source Cite
Cited By0
View next paperApproximate matching using interval jumping searching algorithms for DNA sequences