Pages that link to "Item:Q500990"

The following pages link to Approximation algorithms for sorting by length-weighted prefix and suffix operations (Q500990):

Displaying 10 items.

• Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
• Sorting permutations and binary strings by length-weighted rearrangements (Q683752) (← links)
• Improved bounds on sorting by length-weighted reversals (Q931719) (← links)
• Prefix and suffix reversals on strings (Q1647842) (← links)
• Approximation algorithms for sorting permutations by fragmentation-weighted operations (Q1660115) (← links)
• \(p\)-suffix sorting as arithmetic coding (Q1932361) (← links)
• Length-weighted \(\lambda\)-rearrangement distance (Q2025054) (← links)
• Approximation algorithms for sorting permutations by length-weighted short rearrangements (Q2132329) (← links)
• Combinatorial Pattern Matching (Q5315347) (← links)
• Algorithms – ESA 2005 (Q5475852) (← links)