Computing Nonoverlapping Inversion Distance Between Two Strings in Linear Average Time.

Biological events like inversions are not automatically detected by the usual alignment algorithms. Alignment with inversions does not have a known polynomial time algorithm and Schöniger and Waterman introduced a simplification of the alignment problem with nonoverlapping inversions, where all regions will not be allowed to overlap. They presented an \documentclass{aastex}\usepackage{amsbsy}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{bm}\usepackage{mathrsfs}\usepackage{pifont}\usepackage{stmaryrd}\usepackage{textcomp}\usepackage{portland, xspace}\usepackage{amsmath, amsxtra}\usepackage{upgreek}\pagestyle{empty}\DeclareMathSizes{10}{9}{7}{6}\begin{document} $${ \cal O} ( {n^6} )$$ \end{document} algorithm to compute nonoverlapping inversion distance between two strings of length n. The time and space complexities were improved to \documentclass{aastex}\usepackage{amsbsy}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{bm}\usepackage{mathrsfs}\usepackage{pifont}\usepackage{stmaryrd}\usepackage{textcomp}\usepackage{portland, xspace}\usepackage{amsmath, amsxtra}\usepackage{upgreek}\pagestyle{empty}\DeclareMathSizes{10}{9}{7}{6}\begin{document} $${ \cal O} ( {n^3} )$$ \end{document} and \documentclass{aastex}\usepackage{amsbsy}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{bm}\usepackage{mathrsfs}\usepackage{pifont}\usepackage{stmaryrd}\usepackage{textcomp}\usepackage{portland, xspace}\usepackage{amsmath, amsxtra}\usepackage{upgreek}\pagestyle{empty}\DeclareMathSizes{10}{9}{7}{6}\begin{document} $${ \cal O} ( {n^2} )$$ \end{document} later by Cho, Vellozo, and Ta. In this article, a linear space and linear average time algorithm to compute the inversion distance between two strings of the same length is presented. The recursive formula for this purpose is new to the best of our knowledge. The space costs of the algorithms to solve the same problem are quadratic in the literature, and thus our original algorithm is the first linear space and linear average time algorithm to solve the inversion distance problem.