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

Gary Benson, Yozen Hernandez, Joshua Loving

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

Mapping of next-generation sequencing data and other pro-cessor-intensive sequence comparison applications have motivated a continued search for high efficiency sequence alignment algorithms. In one approach, which exploits the inherent parallelism in computer logic calculations, individual cells in an alignment scoring matrix are represented as bits in a computer word and the calculation of scores is emulated by a series of bit operations comprised of AND, OR, XOR, complement, shift, and addition. Bit-parallelism has been successfully applied to the Longest Common Subsequence (LCS) and edit-distance problems, producing solutions which are significantly faster than standard implementations. But, the intensive mental effort required to produce these solutions, which are closely tied to special properties of the problems, has limited efforts to extend bit-parallelism to more general scoring schemes. In this paper, we give the first bit-parallel solution for general, integer-scoring global alignment. Integer-scoring schemes, which are widely used, assign integer weights for match, mismatch, and insertion/deletion or indel. Our method depends on structural properties of the relationship between adjacent scores in the scoring matrix. We utilize these properties to construct a class of efficient algorithms, each designed for a particular set of weights, and we introduce a standard for characterizing the efficiency in terms of the average number of bit-operations per cell of the original scoring matrix.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings
Pages50-61
Number of pages12
DOIs
StatePublished - 2013
Externally publishedYes
Event24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013 - Bad Herrenalb, Germany
Duration: 17 Jun 201319 Jun 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7922 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013
Country/TerritoryGermany
CityBad Herrenalb
Period17/06/1319/06/13

Keywords

  • bit-parallelism
  • global sequence alignment
  • integer weights

Fingerprint

Dive into the research topics of 'A bit-parallel, general integer-scoring sequence alignment algorithm'. Together they form a unique fingerprint.

Cite this