REPuter: fast computation of maximal repeats in complete genomes.
BioinformaticsPublished 1 May 1999Open access
Stefan Kurtz, Chris Schleiermacher
Citations497
SJR quartileQ1
SJR score2.45
SNIP1.47
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A software tool was implemented that computes exact repeats and palindromes in entire genomes very efficiently and achieves high precision very efficiently.
Abstract
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/).
Keywords
Biochemistry, Genetics and Molecular Biology
Nucleic Acids ResearchA comprehensive set of sequence analysis programs for the VAX
14,423 Citations1984John Devereux, Paul Haeberli +1 more
A group of programs that will interact with each other has been developed for the Digital Equipment Corporation VAX computer using the VMS operating system.
Cambridge University Press eBooksAlgorithms on Strings, Trees and Sequences
3,045 Citations1997Dan Gusfield
Ukkonen’s method is the method of choice for most problems requiring the construction of a suffix tree, and it will be presented first because it is easier to understand.
Journal of the ACMA Space-Economical Suffix Tree Construction Algorithm
1,518 Citations1976Edward M. McCreight
A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching that has the same asymptotic running time bound as previously published algorithms, but is more economical in space.
Software Practice and ExperienceReducing the space requirement of suffix trees
333 Citations1999Stefan Kurtz
This work shows that suffix trees store various kinds of redundant information, and exploits these redundancies to obtain more space efficient representations, which can be constructed without extra space, and as fast as previous representations.
Nucleic Acids ResearchAn efficient method for finding repeats in molecular sequences
116 Citations1983Hugo M. Martínez
The problem of finding repeats in molecular sequences is approached as a sorting problem and leads to a method which is linear in space complexity and NlogN in expected time complexity, and which can be used to handle large sequences with relative ease.
Journal of Molecular BiologyAn efficient algorithm for identifying matches with errors in multiple long molecular sequences
62 Citations1991Ming‐Ying Leung, B. Edwin Blaisdell +2 more
An efficient algorithm is described for finding matches, repeats and other word relations, allowing for errors, in large data sets of long molecular sequences, in a database of Escherichia coli DNA sequences.
PubMedThe Repeat Pattern Toolkit (RPT): analyzing the structure and evolution of the C. elegans genome.
39 Citations1994Pankaj Agarwal, David J. States
A Repeat Pattern Toolkit (RPT) is assembled to analyze the patterns of repeats occurring in DNA, and over 7000 families of repetitive sequences were identified.