SPRING: Sorting Permutation by Reversals and block-INterchanGes (Help)


Input or paste a set of sequences in FASTA format:

or upload the plain text file of sequences in FASTA format:

Rearrangement operations: reversals (inversions) block-interchanges both
Minimum multi-MUM length: (The default is log2(average sequence length).)
Minimum LCB (Locally Collinear Block) weight: (The default is 3*(minimum multi-MUM length).)
Chromosome type: linear circular
Show optimal rearrangement scenarios? yes no
Enter your email address:

Input or paste a set of gene/landmark orders in FASTA-like format:

or upload the plain text file of gene/landmark orders in FASTA-like format:

Rearrangement operations: reversals (inversions) block-interchanges both
Chromosome type : linear circular
Show optimal rearrangement scenarios? yes no

SPRING by Ying Chih Lin1, Chin Lung Lu2, Ying-Chuan Liu1 and Chuan Yi Tang1
1Department of Computer Science, National Tsing Hua University, Taiwan, ROC.
2Department of Biological Science and Technology, National Chiao Tung University, Taiwan, ROC.
The identified LCBs are computed using a program from
Mauve, Copyright © 2003-2005, Aaron Darling
The program for sorting permutation by reversals is derived from a Java applet, Copyright © 1999, Itsik Mantin and Ron Shamir