On the Cost of Interchange Rearrangement in Strings

DOI10.1007/978-3-540-75520-3_11zbMath1151.68387OpenAlexW1480013244MaRDI QIDQ5900366

Amihood Amir, Avivit Levy, Tzvika Hartman, Ely Porat, Oren Kapah

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_11

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (7)

A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance ⋮ Pattern matching with address errors: rearrangement distances ⋮ Transposition Rearrangement: Linear Algorithm for Length-Cost Model ⋮ Approximation algorithms for grooming in optical network design ⋮ Interchange rearrangement: the element-cost model ⋮ Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances ⋮ Approximate string matching with address bit errors

This page was built for publication: On the Cost of Interchange Rearrangement in Strings