Transposition Rearrangement: Linear Algorithm for Length-Cost Model

Łukasz Mikulski


The contemporary computational biology gives motivation to study dependencies between finite sequences. Primary structures of DNA or proteins are represented by such sequences (also called words or strings). In the paper a linear algorithm, computing the distance between two words, is presented. The model operates with transpositions of single letters. The cost of a single transposition is equal to the distance which transposed letter has to cover. Other papers concerning the model give, as the best known, algorithms of time complexity O(n log n). The complexity of our algorithm is O(nk), where k is the size of the alphabet, and O(n) when the size is fixed.

Full Text:


Data publikacji: 2015-01-04 00:00:00
Data złożenia artykułu: 2016-04-27 15:28:16


Total abstract view - 294
Downloads (from 2020-06-17) - PDF - 0



  • There are currently no refbacks.

Copyright (c) 2015 Annales UMCS Sectio AI Informatica

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.