Journal ArticleOPEN ACCESS

REPuter: Fast computation of maximal repeats in complete genomes

Bioinformatics (1999) 15(5) 426-427
DOI: 10.1093/bioinformatics/15.5.426
385Citations
Citations of this article
162Readers
Mendeley users who have this article in their library.

Abstract

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/reputer/).

Cite

CITATION STYLE

APA

Kurtz, S., & Schleiermacher, C. (1999). REPuter: Fast computation of maximal repeats in complete genomes. Bioinformatics, 15(5), 426–427. https://doi.org/10.1093/bioinformatics/15.5.426

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free