Transposition rearrangement: linear algorithm for length-cost model

DOI10.2478/V10065-009-0001-4MaRDI QIDQ5406676zbMATH OpenOpenAlexFDO

Authors Łukasz Mikulski

Publication date 2 April 2014

Published in Annales UMCS, Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://journals.umcs.pl/ai/article/view/3246

Mathematics Subject Classification ID

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

Recommendations

• Sorting by Transpositions
• Polynomial-time algorithm for computing translocation distance between genomes
• Publication:4886096
• A New and Faster Method of Sorting by Transpositions
• scientific article; zbMATH DE number 910920

Cites work

• Algorithms on Strings, Trees and Sequences
• Interchange rearrangement: the element-cost model
• On the Cost of Interchange Rearrangement in Strings
• Reversals and Transpositions Over Finite Alphabets
• Sorting by Transpositions

Cited in

(4)

• Linear algorithm for minimal rearrangement of structures
• String Processing and Information Retrieval
• Interchange rearrangement: the element-cost model
• An efficient algorithm for computing non-overlapping inversion and transposition distance

This page was built for publication: Transposition rearrangement: linear algorithm for length-cost model

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