1. Bentley, J.: Programming Pearls. Addison-Wesley, Reading (1986)
2. Ruzzo, W.L., Tompa, M.: A linear time algorithm for finding all maximal scoring subsequences. In: Proceedings of the 7th International Conference on Intelligent Systems for Molecular Biology, pp. 234–241. AAAI Press, Menlo Park (1999)
3. Lecture Notes in Bioinformatics;M. Csuros,2004
4. Wen, Z.: Fast parallel algorithm for the maximum sum problem. Parallel Computing 21, 461–466 (1995)
5. Lecture Notes in Computer Science;C.E.R. Alves,2004