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

DOI10.1016/J.IPL.2016.07.004zbMATH Open1371.68341OpenAlexW2491483838MaRDI QIDQ738880FDOQ738880

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

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

Recommendations

• Two-string consensus problem under non-overlapping inversion and transposition distance
• Transposition rearrangement: linear algorithm for length-cost model
• Alignment with non-overlapping inversions and translocations on two strings
• Alignment with non-overlapping inversions on two strings
• scientific article; zbMATH DE number 1962813

zbMATH Keywords

algorithmscomputational biologyinversiontranspositionmutation distance

Mathematics Subject Classification ID

Algorithms on strings (68W32)

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

Cited In (6)

• Computation of chromosomal inversion distance using matroidal structures
• Algorithms and Computation
• Block reversal on finite words
• A note on complexity of genetic mutations
• Interchange rearrangement: the element-cost model
• Two-string consensus problem under non-overlapping inversion and transposition distance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q738880)