Every bidirectional alignment with finite objective score must align exactly one word in e to each word in f, encoding a permutation a.
moreover, each possible permutation has a finite score: the negation of the total distance to traverse the N cities in order a under distance c. solving such a bidirectional alignment problem would find a minimal Hamiltonian path of the TSP encoded in this way, concluding the reduction.