1. Ben-Dor, A., Karp, R. M., Schwikowski, B., Shamir, R.: The restriction scaffold problem. J. Comput. Biol. 10(2), 385–398 (2003)
2. Burkard, R. E., Çela, E.: Linear assignment problems and extensions. In: Du, D.-Z., Pardalos, P. M. (eds.): Handbook of Combinatorial Optimization—Supplement, vol. A, vol. 4, pp. 75–149. Kluwer, Dordrecht (1999)
3. Buss, S. R., Yianilos, P. N.: A bipartite matching approach to approximate string comparison and search. Technical report, NEC Research Institute, Princeton, New Jersey (1995)
4. Colannino, J., Damian, M., Hurtado, F., Iacono, J., Meijer, H., Ramaswami, S., Toussaint, G.: A O(n log n)-time algorithm for the restricted scaffold assignment problem. J. Comput. Biol. 13(4) (2006)
5. Colannino, J., Toussaint, G.: Faster algorithms for computing distances between one-dimensional point sets. In: Santos, F., Orden, D. (eds.) Proceedings of the XI Encuentros de Geometria Computacional, pp. 189–198, Santander, Spain, June 27–29 (2005)