Distances between Balanced Strings
Guillaume Fertin, Anthony Labarre, Irena Rusu, Éric Tannier, Steéphane Vialette · The MIT Press eBooks · 2009
Deletions, insertions, duplications, and replacement events are necessary to compare arbitrary strings, because the gene content of the strings is different. This chapter considers the case of balanced strings, where the equal gene content allows us to deal with duplicated genes without having to account for these edit operations. The discussions cover minimum common string partition problems; reversal distance; unsigned transpositions; unsigned block interchanges; and relations between distances.