Skip to main content
Conference ProceedingsOPEN ACCESS

Parallel sequence alignment: A lookahead approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3776 LNCS 636-639
DOI: 10.1007/11590316_101
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we present a parallel algorithm for local alignment of two biological sequences. Given two sequences of size m and n, our algorithm uses a novel technique namely, carry lookahead and requires O(m/4 + n/2) time on a maximum of O(m) processors. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Jana, P. K., & Kumar, N. (2005). Parallel sequence alignment: A lookahead approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3776 LNCS, pp. 636–639). https://doi.org/10.1007/11590316_101

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free