The DOI matches its Crossref record.
REPuter: fast computation of maximal repeats in complete genomes.
Open accessAbstract
SUMMARY: A software tool was implemented that computes exact repeats and palindromes in entire genomes very efficiently. AVAILABILITY: Via the Bielefeld Bioinformatics Server (http://bibiserv.techfak.uni-bielefeld.de/rep uter/).
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.
Integrity signals
Registry
Cites
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.
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
Cited by
REPuter: the manifold applications of repeat analysis on a genomic scale
Kurtz, S. (2001) · Nucleic Acids Research · doi:10.1093/nar/29.22.4633 · Cited by 2,618
Self-citationCRISPRFinder: a web tool to identify clustered regularly interspaced short palindromic repeats
Grissa, I., Vergnaud, G., & Pourcel, C. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkm360 · Cited by 1,875
Haft, D. H., Selengut, J., Mongodin, E. F., & Nelson, K. E. (2005) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0010060 · Cited by 979
Wu, M., Sun, L. V., Vamathevan, J., Riegler, M., Deboy, R., Brownlie, J. C., McGraw, E. A., Martin, W., Esser, C., Ahmadinejad, N., et al. (2004) · PLoS Biology · doi:10.1371/journal.pbio.0020069 · Cited by 851
“2001), which makes use of the REPuter algorithm (Kurtz and Schleiermacher 1999) to find maximal-length repeats.”
PatternHunter: faster and more sensitive homology search
Ma, B., Tromp, J., & Li, M. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.3.440 · Cited by 829
Metadata
- Authors
- Kurtz, S., & Schleiermacher, C.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 1999-05-01
- Volume
- 15
- Issue
- 5
- Pages
- 426-427
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2116628377
- Cited by
- 479
- References
- 0
- FWCI
- 19.53
- Type
- journal article
- 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: REPuter: fast computation of maximal repeats in complete genomes. https://app.cochat.ai/papers/10.1093/bioinformatics/15.5.426
- The paper
- Kurtz, S., & Schleiermacher, C. (1999). REPuter: fast computation of maximal repeats in complete genomes. Bioinformatics. https://doi.org/10.1093/bioinformatics/15.5.426
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.
