Interchange rearrangement: the element-cost model

DOI10.1016/j.tcs.2009.07.013zbMath1187.68183OpenAlexW2052423173MaRDI QIDQ732021

Oren Kapah, Nitsan Oz, Gad M. Landau, Avivit Levy

Publication date: 9 October 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.013

zbMATH Keywords

interchange rearrangementrearrangement cost modelsstrings rearrangement distances

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (5)

Exploiting pseudo-locality of interchange distance ⋮ Computing similarity distances between rankings ⋮ Using swaps and deletes to make strings match ⋮ Transposition Rearrangement: Linear Algorithm for Length-Cost Model ⋮ Approximate string matching with stuck address bits

Cites Work

• Sorting permutations by block-interchanges
• Sorting by bounded block-moves
• Approximate String Matching with Address Bit Errors
• Pattern matching with address errors
• Algorithms on Strings, Trees and Sequences
• Sorting by Transpositions
• Sorting and Selection with Random Costs
• On the Cost of Interchange Rearrangement in Strings

This page was built for publication: Interchange rearrangement: the element-cost model