An injection structure is presented by a finite-state transducer if its domain is a regular set of strings and its injection is realized by a finite-state transducer (deterministic input-output automaton). In this talk, I will present recent joint work with Jeff Remmel and Doug Center studying FST injection structures, characterizing all those over a unary alphabet, and comparing them to computable injection structures.