REPuter: fast computation of maximal repeats in complete genomes

被引：322

作者：

Kurtz, S ^{[1
]}

Schleiermacher, C ^{[1
]}

机构：

[1] Univ Bielefeld, Tech Fak, D-33501 Bielefeld, Germany

来源：

关键词：

D O I：

10.1093/bioinformatics/15.5.426

中图分类号：

Q5 [生物化学];

学科分类号：

071010 ; 081704 ;

摘要：

A software tool was implemented that computes exact repeats and palindromes in entire genomes very efficiently.

引用

页码：426 / 427

页数：2

共 8 条

[1]

AGARWAL P, 1994, P 2 INT C INT SYST M, P1

[2] A COMPREHENSIVE SET OF SEQUENCE-ANALYSIS PROGRAMS FOR THE VAX [J].

DEVEREUX, J ;

HAEBERLI, P ;

SMITHIES, O .

[3]

Gusfield D, 1997, ALGORITHMS STRINGS T

[4]

Kurtz S., 1998, 9803 U BIEL TECHN FA

LEUNG, MY ;

BLAISDELL, BE ;

BURGE, C ;

KARLIN, S .

[6] AN EFFICIENT METHOD FOR FINDING REPEATS IN MOLECULAR SEQUENCES [J].

MARTINEZ, HM .

[7] SPACE-ECONOMICAL SUFFIX TREE CONSTRUCTION ALGORITHM [J].

MCCREIGHT, EM .

[8]

RIVALS E, 1997, P WORKSH GEN INF TOK