Abstract
DNA sequence matching is used in the identification of a relationship between a fragment of DNA and its owner by mean of a database of DNA registers. A DNA fragment could be a hair sample left at a crime scene by a suspect or provided by a person for a paternity exam. The process of aligning and matching DNA sequences is a computationally demanding process. In this chapter, we propose a novel parallel hardware architecture for DNA matching based on the steps of the BLAST algorithm. The design is scalable so that its structure can be adjusted depending on size of the subject and query DNA sequences. Moreover, the number of units used to perform in parallel can also be scaled depending some characteristics of the algorithm. The design was synthesized and programmed into FPGA. The trade-off between cost and performance were analyzed to evaluate different design configuration.
This chapter was developed in collaboration with Edgar José Garcia Neto Segundo.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Altschul, S., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. Journal of Molecular Biology 215(3), 403–413 (1990)
Mount, D.W.: Steps used by the BLAST algorithm. Cold Spring Harbor Protocols: Molecular Biology (2007), doi:10.1101/pdb.ip41
Needlman, S., Wunsh, S.: A general method applicable to the search of similarities in Amino-Acid sequence of two protein. Journal of Molecular Biology 1(48), 443–453 (1970)
Garcia Neto Segundo, E.J., Nedjah, N., de Macedo Mourelle, L.: A parallel architecture for DNA matching. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds.) ICA3PP 2011, Part II. LNCS, vol. 7017, pp. 399–407. Springer, Heidelberg (2011)
Giegerich, R.A.: Systematic approach to dynamic programming in bioinformatics. Bioinformatics 8(16), 665–677 (2000)
Kasap, S., Benkrid, K.: High performance phylogenetic analysis with maximum parsimony on reconfigurable hardware. IEEE Transactions on Very Large Scale Integration VLSI Systems 99(5), 796–808 (2011)
Pearson, W.: Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms. Genomics 3(11), 635–650 (1991)
Rubin, E., Pietrokovski, S.: Heuristic methods for sequence alignment. Advanced Topics in Bioinformatics, Weizmann Institute of Science (2003)
Shaper, E.G., et al.: Sensitivity and selectivity in protein similarity searches: a comparison of Smith-Waterman in hardware to BLAST and FASTA. Genomics 2(38), 179–191 (1996)
Waterman, M.S.: Introduction to Computational Biology. CRC Press (1995)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Nedjah, N., de Macedo Mourelle, L. (2014). Reconfigurable Hardware for DNA Matching. In: Hardware for Soft Computing and Soft Computing for Hardware. Studies in Computational Intelligence, vol 529. Springer, Cham. https://doi.org/10.1007/978-3-319-03110-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-03110-1_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03109-5
Online ISBN: 978-3-319-03110-1
eBook Packages: EngineeringEngineering (R0)