Português
Sections
Rearrangement Distance Database
GRAAu
Audit Results
Audit Status
Publications
Filter Results
Algorithm id
Algorithm name
Rearrangement model
Reversal
Transposition
Reversal and Transposition
Signed Reversal
Signed Reversal and Transposition
Prefix Reversal
Prefix Transposition
Prefix Reversal and Prefix Transposition
Signed Prefix Reversal
Signed Reversal, Transposition, and Signed Transreversal (A and B)
Signed Reversal, Transposition, and Signed Transreversal (A)
Transposition and Signed Transreversal (A and B)
Signed Reversal, Transposition, and Signed Transreversal (B)
Symmetric Reversal
Signed Symmetric Reversal
Signed Almost Symmetric Reversal (asymmetry level 1)
Signed Almost Symmetric Reversal (asymmetry level 2)
Almost Symmetric Reversal (asymmetry level 1)
Almost Symmetric Reversal (asymmetry level 2)
Signed Almost Symmetric Reversal (asymmetry level 1) and Unitary Signed Reversal
Short Swap (Short Reversal)
Prefix Reversal and Suffix Reversal
Signed Prefix Reversal and Signed Suffix Reversal
Prefix Reversal, Prefix Transposition, Suffix Reversal, and Suffix Transposition
Signed Prefix Reversal, Prefix Transposition, Signed Suffix Reversal, and Suffix Transposition
Signed Prefix Reversal and Prefix Transposition
Prefix Transposition and Suffix Transposition
Strip Move
Prefix Strip Move
Prefix Strip Move and Suffix Strip Move
Short Transposition
Short Reversal and Short Transposition
Signed Short Reversal
Signed Short Reversal and Short Transposition
Reversal, Transposition, and Transreversal
Super Short Cyclic Reversal
Signed Super Short Cyclic Reversal
Signed Super Short Cyclic Reversal and Super Short Cyclic Transposition
Super Short Reversal
Signed Super Short Reversal
Signed Super Short Reversal and Super Short Transposition
Audit Results
This section contains the results obtained from the audit of rearrangement algorithms.
Algorithm name:
BenoitHamel
Rearrangement model:
Transposition
Submission date:
Oct 19, 2011
<p class="authors">The 3-approximation algorithm developed by <a href="http://www.springerlink.com/content/v18445v023840823/" target="_blank">Benoît-Gagné and Hamel</a> for sorting by transpositions (easy way).</p>
Algorithm name:
WattersonAndColleagues
Rearrangement model:
Reversal
Submission date:
Oct 19, 2011
<p>The approximation algorithm developed by <a href="http://www.sciencedirect.com/science/article/pii/0022519382903848" target="_blank">Watterson and colleagues</a> for sorting by reversals.</p>
Algorithm name:
KececiogluSankoffAlgorithm
Rearrangement model:
Reversal
Submission date:
Oct 20, 2011
<p>The 2-approximation algorithm developed by <a href="http://www.springerlink.com/content/u78h582353106542/" target="_blank">Kececioglu and Sankoff</a> for sorting by reversals.</p>
««
«
1
2
3
4
5
»
»»
Maximum Ratio Permutations
Confirmation
Are you sure you want to delete this algorithm?
Password:
Confirmation
Are you sure you want to delete the results of this algorithm?
Password: