Pulse nav.journalClub Trends Entdecken Fragen Forschende

Download the App

Join discussions, follow papers, and never miss your next session.

© Synapse Social LLC, 2026Datenschutz

Start Entdecken nav.journalClub Trends

⌘+K

May 1, 1999Open Access

REPuter: fast computation of maximal repeats in complete genomes.

Key Points

Key points are not available for this paper at this time.

Abstract

Via the Bielefeld Bioinformatics Server (http://bibiserv.techfak.uni-bielefeld.de/rep uter/).

Read Full Paperexternally

Like

Bookmark

Share

View Full Paper

Cite This Study

Kurtz et al. (Sat,) studied this question.

synapsesocial.com/papers/69de7a366e50a6aba3e93b4c https://doi.org/https://doi.org/10.1093/bioinformatics/15.5.426

Like

Bookmark

Share

View Full Paper

REPuter: fast computation of maximal repeats in complete genomes. | Synapse

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1A comprehensive set of sequence analysis programs for the VAX1984 · 14,422 citations
2A Space-Economical Suffix Tree Construction Algorithm1976 · 1,518 citations
3An efficient method for finding repeats in molecular sequences1983 · 116 citations
4An efficient algorithm for identifying matches with errors in multiple long molecular sequences1991 · 62 citations
5Algorithms on Strings, Trees and Sequences1997 · 3,067 citations