Two-string consensus problem under non-overlapping inversion and transposition distance
From MaRDI portal
Publication:1679911
DOI10.1016/J.IPL.2017.10.006zbMath1422.92107OpenAlexW2770410109MaRDI QIDQ1679911
Chin Lung Lu, Toan Thang Ta, Cheng-Yao Lin
Publication date: 22 November 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2017.10.006
Cites Work
- On the hardness of the consensus string problem
- On covering problems of codes
- An efficient algorithm for computing non-overlapping inversion and transposition distance
- Alignment with non-overlapping inversions and translocations on two strings
- Two Algorithms for the Minimum Enclosing Ball Problem
- Alignment with Non-overlapping Inversions on Two Strings
This page was built for publication: Two-string consensus problem under non-overlapping inversion and transposition distance