1. M. D. V. Braga. Grafos de Seqüências de DNA. Master’s thesis, Instituto de Computação, UNICAMP, Campinas, SP, November 2000. In Portuguese at
http://www.ic.unicamp.br
/~meidanis/research/fa.html.
2. R. Diestel. Graph Theory. Springer-Verlag New York, Inc, 1997.
3. C. E. Ferreira, C. C. de Souza, and Y. Wakabayashi. Rearrangement of DNA fragments: a branch-and-cut algorithm. Discrete Applied Mathematics, 2001. To appear.
4. D. Gusfield, G. M. Landau, and B. Schieber. An efficient algorithm for the all pairs suffix-prefix problem. Information Processing Letters, 41(4):181–185, March 1992.
5. A. Schrijver. Bipartite edge coloring in O(Δm) time. SIAM Journal on Computing, 28(3):841–846, 1998.