Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Two-string consensus problem under non-overlapping inversion and transposition distance

From MaRDI portal
Publication:1679911
Jump to:navigation, search

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


zbMATH Keywords

algorithmstranspositioninversioncomputational biologytwo-string consensus problem


Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)





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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1679911&oldid=13993398"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 05:14.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki