Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 342

The DOI matches its Crossref record; 102 of the 102 references it cites were found in a registry or an index.

Eukaryotic Promoter Recognition

Open access
Fickett, James W., Hatzigeorgiou, Artemis G.·1997·Genome Research

Abstract

Only recently has it become common to determine eukaryotic genomic sequences large enough to contain several genes. With these data comes a new problem for gene finding programs: to partition a set of exons correctly among several genes. One line of development in eukaryotic gene identification begins with coding region identification by statistical means and adds pattern recognition for sites of transcriptional, splicing, and translational control to produce algorithms capable of suggesting overall gene structure (for review, see Gelfand 1995; Fickett 1996a). To date, most development effort has focused on integration of the various kinds of pattern information in the relatively simple case where a single complete gene is present in the input sequence. In this case, current algorithms usually suggest a putative protein translation similar to that in the literature, though there is still significant room for improvement (Burset and Guigo 1996). The extension of these algorithms to deal with a sequence containing multiple or partial genes is just beginning (Burge and Karlin 1997; http://gnomic.stanford.edu/∼chris/GENSCANW.html). Because the signals that control the start and stop of transcription and translation, and the location of splicing, are still not very well understood, it is not uncommon for a gene-finding algorithm to confuse internal with initial and terminal exons, thus wrongly partitioning the exons. The problem is compounded by our incomplete understanding of alternative splicing control elements. Another line of development in gene identification is based on homology (e.g., Gish and States 1993; Gelfand et al. 1996). If there is a close homolog in the databases to one of the genes in the sequence under analysis, sequence similarity will usually group the exons for this gene correctly. Still, in many cases there is no close homolog and no guarantee when there is some homolog that the encoded protein lacks insertions/deletions. Clearly, some means of recognizing the beginnings of genes, probably via the promoter, or the ends, probably by means of the polyadenylation signal or translation termination signal (e.g., Kondrakhin et al. 1994; Wahle and Keller 1996; Dalphin et al. 1997; Solovyev and Salamov 1997), would enable a major advance. The promoter seems to be a much richer signal than the 38 processing signals, though, as we shall see below, it is not easy to take advantage of the information in the promoter.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1101/gr.7.9.861

Cites

102 of 102 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 102 references

Cited by

See all 342

Metadata

Authors
Fickett, J. W., & Hatzigeorgiou, A. G.
Venue
Genome Research
Published
1997-09-01
Volume
7
Issue
9
Pages
861-878
ISSN
  • 1088-9051 (ISSN-L)
  • 1549-5469
OpenAlex
W2169351355
Cited by
342
References
102
Type
posted content
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Eukaryotic Promoter Recognition. https://app.cochat.ai/papers/10.1101/gr.7.9.861
The paper
Fickett, J. W., & Hatzigeorgiou, A. G. (1997). Eukaryotic Promoter Recognition. Genome Research. https://doi.org/10.1101/gr.7.9.861

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.