A Parallel Architecture for DNA Matching
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.
KeywordsLocal Search Query Sequence Parallel Architecture Subject Sequence Identical String
Unable to display preview. Download preview PDF.
- 6.ModelSim, High performance and capacity mixed HDL simulation, Mentor Graphics (2011), http://model.com
- 7.Mount, D.W.: Bioinformatics: sequence and genome analysis, 2nd edn. Cold Spring Harbor Laboratory Press (2004)Google Scholar
- 8.Navabi, Z.: VHDL: Analysis and modeling of digital systems, 2nd edn. McGraw Hill, New York (1998)Google Scholar
- 13.Searls, D.: The language of genes, vol. 420, pp. 211–217 (2002)Google Scholar
- 17.Wolf, W.: FPGA-based system design. Prentice-Hall, Englewood Cliffs (2004)Google Scholar