论文信息 - GRIMM: genome rearrangements web server

GRIMM: genome rearrangements web server

SUMMARY 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. AVAILABILITY A web server, with instructions and sample data, is available at http://www-cse.ucsd.edu/groups/bioinformatics/GRIMM.

Glenn Tesler | G. Tesler

[1] Pavel A. Pevzner,et al. Transforming men into mice (polynomial algorithm for genomic distance problem) , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[2] Alberto Caprara,et al. Sorting Permutations by Reversals and Eulerian Cycle Decompositions , 1999, SIAM J. Discret. Math..

[3] P. Pevzner,et al. Genome-scale evolution: reconstructing gene orders in the ancestral species. , 2002, Genome research.

[4] Pavel A. Pevzner,et al. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.

[5] Pavel A. Pevzner,et al. Computational molecular biology : an algorithmic approach , 2000 .

[6] David A. Bader,et al. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study , 2001, J. Comput. Biol..

[7] Pavel A. Pevzner,et al. To cut…or not to cut (applications of comparative physical maps in molecular evolution) , 1996, SODA '96.

[8] David A. Bader,et al. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study , 2001, WADS.