  Unbalanced translocations are among the most frequent chromosomal
alterations, accounted for 30\% of all losses of heterozygosity, a major
genetic event causing inactivation of tumor suppressor genes. Despite of their
central role in genomic sequence analysis, little attention has been devoted to
the problem of matching sequences allowing for this kind of chromosomal
alteration. In this paper we investigate the \emph{approximate string matching}
problem when the edit operations are non-overlapping unbalanced translocations
of adjacent factors. In particular, we first present a $O(nm^3)$-time and
$O(m^2)$-space algorithm based on the dynamic-programming approach. Then we
improve our first result by designing a second solution which makes use of the
Directed Acyclic Word Graph of the pattern. In particular, we show that under
the assumptions of equiprobability and independence of characters, our
algorithm has a $O(n\log^2_{\sigma} m)$ average time complexity, for an
alphabet of size $\sigma$, still maintaining the $O(nm^3)$-time and the
$O(m^2)$-space complexity in the worst case. To the best of our knowledge this
is the first solution in literature for the approximate string matching problem
allowing for unbalanced translocations of factors.
