BitPAl: A bit-parallel, general integer-scoring sequence alignment algorithm

Bioinformatics

Volumn 30, Issue 22, 2014, Pages 3166-3173

  Loving, Joshua ^a   Hernandez, Yozen ^a   Benson, Gary ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; COMPUTER PROGRAM; HIGH THROUGHPUT SEQUENCING; PROCEDURES; SEQUENCE ALIGNMENT;

ALGORITHMS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; SEQUENCE ALIGNMENT; SOFTWARE;

EID: 84911448237     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btu507     Document Type: Article

References (17)

1. Allison, L. and Dix, T.I. (1986) A bit-string longest-common-subsequence algorithm. Inf. Process. Lett., 23, 305-310.
2. Baeza-Yates, R. and Gonnet, G.H. (1992) A new approach to text searching. Commun. ACM, 35, 74-82.
3. Benson, G. et al. (2013) A bit-parallel, general integer-scoring sequence alignment algorithm. In: Fischer, J. and Sanders, P. (eds) Combinatorial Pattern Matching, Vol. 7922 of Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp. 50-61.
4. Bergeron, A. and Hamel, S. (2002) Vector algorithms for approximate string matching. Int. J. Found. Comput. Sci., 13, 53-65.
5. Crochemore, M. et al. (2001) A fast and practical bit-vector algorithm for the longest common subsequence problem. Inform. Process. Lett., 80, 279-285.
6. Gelfand, Y. et al. (2014) VNTRseek-a computational tool to detect tandem repeat variants in high-throughput sequencing data. Nucleic Acids Res, doi: 10.1093/ nar/gku642.
7. Hyyr ö,H. (2004) Bit-parallel LCS-length computation revisited. In: Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA 2004), University of Sydney, Australia.
8. Hyyr Ö, H. and Navarro, G. (2005) Bit-parallel witnesses and their applications to approximate string matching. Algorithmica, 41, 203-231.
9. Hyyr Ö, H. and Navarro, G. (2006) Bit-parallel computation of local similarity score matrices with unitary weights. Int. J. Found. Comput. Sci., 17, 1325-1344.
10. Hyyr Ö, H. et al. (2005) Increased bit-parallelism for approximate and multiple string matching. J. Exp. Algorithmics, 10, 2-6
11. Kernighan, B. and Ritchie, D. (1988) The C Programming Language. 2nd edn. Prentice Hall, Upper Saddle River, NJ, USA.
12. Myers, G. (1999) A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM, 46, 395-415.
13. Navarro, G. (2004) Approximate regular expression searching with arbitrary integer weights. Nordic J. Comput., 11, 356-373.
14. Needleman, S. and Wunch, C. (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
15. Smith, T. and Waterman, M. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
16. Wu, S. and Manber, U. (1992) Fast text searching: allowing errors. Commun. ACM, 35, 83-91.
17. Wu, S. et al. (1996) A subquadratic algorithm for approximate limited expression matching. Algorithmica, 15, 50-67.