Abstract
In genomics, pattern matching against a sequence of nucleotides plays a pivotal role for DNA sequence alignment and comparing genomes. This helps tackling some diseases, such as cancer in humans. The complexity of searching biological sequences in big databases has transformed sequence alignment problem into a challenging field of research in bioinformatics. A large number of research has been carried to solve this problem based on electronic computers. The required extensive amount of computations for handling this huge database in electronic computers leads to vast amounts of energy consumption for electrical processing and cooling. On the other hand, optical processing due to its parallel nature is much faster than electrical counterpart at a fraction of energy consumption level and cost. In this paper, an algorithm based on optical parallel processing is proposed that not only locate similarity between sequences but also determines the exact location of edits. The proposed algorithm is based on partitioning the read sequence into some parts, namely, windows, then, computing their correlation with reference sequence in parallel. Multiple metamaterial based optical correlators are used in parallel to optically implement the architecture. Design limitations and challenges of the architecture are also discussed in details. The simulation results, comparing with the well-known BLAST algorithm, demonstrate superior speed, accuracy, and much lower power consumption.
Abstract (translated by Google)
URL
https://arxiv.org/abs/1710.01262