SPRING: a tool for the analysis of genome rearrangement using reversals and block-interchanges
Open Access
- 1 July 2006
- journal article
- research article
- Published by Oxford University Press (OUP) in Nucleic Acids Research
- Vol. 34 (Web Server) , W696-W699
- https://doi.org/10.1093/nar/gkl169
Abstract
SPRING () is a tool for the analysis of genome rearrangement between two chromosomal genomes using reversals and/or block-interchanges. SPRING takes two or more chromosomes as its input and then computes a minimum series of reversals and/or block-interchanges between any two input chromosomes for transforming one chromosome into another. The input of SPRING can be either bacterial-size sequences or gene/landmark orders. If the input is a set of chromosomal sequences then the SPRING will automatically search for identical landmarks, which are homologous/conserved regions shared by all input sequences. In particular, SPRING also computes the breakpoint distance between any pair of two chromosomes, which can be used to compare with the rearrangement distance to confirm whether they are correlated or not. In addition, SPRING shows phylogenetic trees that are reconstructed based on the rearrangement and breakpoint distance matrixes.Keywords
This publication has 9 references indexed in Scilit:
- Efficient sorting of genomic permutations by translocation, inversion and block interchangeBioinformatics, 2005
- ROBIN: a tool for genome rearrangement of block-interchangesBioinformatics, 2005
- Genome Rearrangement Distances and Gene Order Phylogeny in γ-ProteobacteriaMolecular Biology and Evolution, 2005
- An Efficient Algorithm for Sorting by Block-Interchanges and Its Application to the Evolution of Vibrio SpeciesJournal of Computational Biology, 2005
- Mauve: Multiple Alignment of Conserved Genomic Sequence With RearrangementsGenome Research, 2004
- GRIL: genome rearrangement and inversion locatorBioinformatics, 2004
- Comparative Genome Analysis of Vibrio vulnificus, a Marine PathogenGenome Research, 2003
- GRIMM: genome rearrangements web serverBioinformatics, 2002
- A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental StudyJournal of Computational Biology, 2001