1. Allison, L., Dix, T.I.: A bit-string longest-common-subsequence algorithm. Information Processing Letters 23(5), 305–310 (1986)
2. Bergeron, A., Hamel, S.: Vector algorithms for approximate string matching. International Journal of Foundations of Computer Science 13(01), 53–65 (2002)
3. Crochemore, M., Iliopoulos, C.S., Pinzon, Y.J., Reid, J.F.: A fast and practical bit-vector algorithm for the longest common subsequence problem. Information Processing Letters 80(6), 279–285 (2001)
4. Gelfand, Y., Loving, J., Hernandez, Y., Benson, G.: VNTRseek – A Computational Pipeline to Detect Tandem Repeat Variants in Next-Generation Sequencing Data: Analysis of the 454 Watson Genome. In: Proc. of RECOMB-seq: The Third Annual RECOMB Satellite Workshop on Massively Parallel Sequencing (to appear, 2013)
5. Hyyrö, H.: Bit-parallel LCS-length computation revisited. In: Proc. 15th Australasian Workshop on Combinatorial Algorithms, AWOCA 2004 (2004)