An efficient sequence alignment algorithm on a LARPBS

Authors:
David Semé;Sidney Youlou
Affiliations:
Laboratoire de Recherche en Informatique d'Amiens, Université de Picardie Jules Verne, Amiens, France;Laboratoire de Recherche en Informatique d'Amiens, Université de Picardie Jules Verne, Amiens, France
Venue:
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Year:
2007

Citing 5
Cited 1

Pipelined communications in optically interconnected arrays

Journal of Parallel and Distributed Computing
FPL Implementation of Systolic Sequence Alignment

Selected papers from the Second International Workshop on Field-Programmable Logic and Applications, Field-Programmable Gate Arrays: Architectures and Tools for Rapid Prototyping
Repetitions detection on a linear array with reconfigurable pipelined bus system

International Journal of Parallel, Emergent and Distributed Systems
Linear array with a reconfigurable pipelined bus system - Concepts and applications

Information Sciences: an International Journal
Fast scalable algorithm on LARPBS for sequence alignment

ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications

An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we give a parallel algorithmsolving the sequence alignment problem on a LARPBS, one of the recently proposed parallel model based on optical bus. The complexity of our algorithm solving the sequence alignment problem is O(m) using n processors (where m and n are respectively the sizes of the shortest and the longest sequences).