An efficient algorithm for computing non-overlapping inversion and transposition distance

DOI10.1016/J.IPL.2016.07.004zbMath1371.68341OpenAlexW2491483838MaRDI QIDQ738880

Chin Lung Lu, Cheng-Yao Lin, Toan Thang Ta

Publication date: 16 August 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.07.004

zbMATH Keywords

algorithmstranspositioninversioncomputational biologymutation distance

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (2)

Two-string consensus problem under non-overlapping inversion and transposition distance ⋮ Block reversal on finite words

Cites Work

• Efficient string-matching allowing for non-overlapping inversions
• String matching with inversions and translocations in linear average time (most of the time)
• Alignment with non-overlapping inversions and translocations on two strings

This page was built for publication: An efficient algorithm for computing non-overlapping inversion and transposition distance