GRIMM: genome rearrangements web server

被引：230

作者：

Tesler, G ^{[1
]}

机构：

[1] Univ Calif San Diego, Dept Comp Sci & Engn, La Jolla, CA 92093 USA

来源：

BIOINFORMATICS | 2002年 / 18卷 / 03期

关键词：

D O I：

10.1093/bioinformatics/18.3.492

中图分类号：

Q5 [生物化学];

学科分类号：

071010 ; 081704 ;

摘要：

Genome Rearrangements In Man and Mouse (GRIMM) is a tool for analyzing rearrangements of gene orders in pairs of unichromosomal and multichromosomal genomes, with either signed or unsigned gene data. Although there are several programs for analyzing rearrangements in unichromosomal genomes, this is the first to analyze rearrangements in multichromosomal genomes. GRIMM also provides a new algorithm for analyzing comparative maps for which gene directions are unknown.

引用

页码：492 / 493

页数：2

共 9 条

[1]

[Anonymous], GRIMMS FAIRY TALES

[2]

BADER DA, 2001, P 7 INT WORKSH ALG D, P365

[3]

Bourque G, 2002, GENOME RES, V12, P26

[4] Sorting permutations by reversals and Eulerian cycle decompositions [J].

Caprara, A .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 1999, 12 (01) :91-110

[5] Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals [J].

Hannenhalli, S ;

Pevzner, PA .

JOURNAL OF THE ACM, 1999, 46 (01) :1-27

[6]

Hannenhalli S, 1995, AN S FDN CO, P581, DOI 10.1109/SFCS.1995.492588

[7]

Hannenhalli S, 1996, PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P304

[8]

MANTIN I, 1999, ALGORITHM SORTING SI

[9]

PEVZNER P, 2000, COMPUTATIONAL MOL BI, pCH10

← 1 →