Alignment with non-overlapping inversions and translocations on two strings

DOI10.1016/j.tcs.2014.10.036zbMath1309.68233OpenAlexW2143926799MaRDI QIDQ2339453

Yo-Sub Han, Da-Jung Cho, Hwee Kim

Publication date: 1 April 2015

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

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

zbMATH Keywords

sequence alignmenttranslocationnon-overlapping inversion

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (5)

Two-string consensus problem under non-overlapping inversion and transposition distance ⋮ Duplications and Pseudo-Duplications ⋮ Pseudo-inversion: closure properties and decidability ⋮ An efficient algorithm for computing non-overlapping inversion and transposition distance ⋮ Quasi-Linear-Time Algorithm for Longest Common Circular Factor

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient string-matching allowing for non-overlapping inversions
• A local algorithm for DNA sequence alignment with inversions
• A space-efficient algorithm for sequence alignment with inversions and reversals
• String matching with inversions and translocations in linear average time (most of the time)
• A Space Efficient Algorithm for Sequence Alignment with Inversions
• A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria
• On Protein Structure Alignment under Distance Constraint
• Approximate String Matching with Swap and Mismatch

This page was built for publication: Alignment with non-overlapping inversions and translocations on two strings