A parallel architecture for DNA matching

Authors:
Edgar J. Garcia Neto Segundo;Nadia Nedjah;Luiza de Macedo Mourelle
Affiliations:
Department of Electronics Engineering and Telecommunications, State University of do Rio de Janeiro, Brazil;Department of Electronics Engineering and Telecommunications, State University of do Rio de Janeiro, Brazil;Department of Systems Engineering and Computation, State University of do Rio de Janeiro, Brazil
Venue:
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
Year:
2011

Citing 4
Cited 1

Bioinformatics: the machine learning approach

Bioinformatics: the machine learning approach
VHDL: Analysis and Modeling of Digital Systems

VHDL: Analysis and Modeling of Digital Systems
FPGA-Based System Design

FPGA-Based System Design
ScalaBLAST: A Scalable Implementation of BLAST for High-Performance Data-Intensive Bioinformatics Analysis

IEEE Transactions on Parallel and Distributed Systems

A scalable parallel reconfigurable hardware architecture for DNA matching

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

DNA sequences can be often showed in fragments, little pieces, found at crime scene or in a hair sample for paternity exam. In order to compare that fragments with a subject or target sequence of a suspect, we need an efficient tool to analyze the DNA sequence alignment and matching. So DNA matching is a bioinformatics field that could find relationships functions between sequences, alignments and them try to understand it. Usually done by software through databases clusters analysis, DNA matching requires a lot of computational resources, what may increase the bioinformatics project budget. We propose the approach of a hardware parallel architecture, based on heuristic method, capable of reducing time spent on matching process.