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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7922 LNCS, Issue , 2013, Pages 50-61

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

^a BOSTON UNIVERSITY   (United States)

Author keywords

bit parallelism; global sequence alignment; integer weights

Indexed keywords

BIT PARALLELISM; GLOBAL SEQUENCE ALIGNMENTS; INHERENT PARALLELISM; INTEGER WEIGHTS; LONGEST COMMON SUBSEQUENCES; NEXT-GENERATION SEQUENCING; SEQUENCE ALIGNMENTS; SEQUENCE COMPARISONS;

ALGORITHMS; ALIGNMENT; PATTERN MATCHING;

MATRIX ALGEBRA;

EID: 84884298304     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38905-4_7     Document Type: Conference Paper

References (13)

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)
6. Hyyrö, H., Fredriksson, K., Navarro, G.: Increased bit-parallelism for approximate and multiple string matching. Journal of Experimental Algorithmics (JEA) 10, 2-6 (2005)
7. Kernighan, B.W., Ritchie, D.M.: The C programming language, 2nd edn. Prentice Hall (1988)
8. Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM (JACM) 46(3), 395-415 (1999)
9. Navarro, G.: Approximate regular expression searching with arbitrary integer weights. Nordic Journal of Computing 11(4), 356-373 (2004)
10. Needleman, S., Wunch, C.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48, 443-453 (1970)
11. Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. Journal of Molecular Biology 147(1), 195-197 (1981)
12. Wu, S., Manber, U.: Fast text searching: allowing errors. Communications of the ACM 35(10), 83-91 (1992)
13. Wu, S., Manber, U., Myers, G.: A subquadratic algorithm for approximate limited expression matching. Algorithmica 15(1), 50-67 (1996)