Understanding the structure and function of DNA sequences represents an important area of research in modern biology. One of the interesting structures occurring in DNA is a palindrome. Biologists believe that palindromes play an important role in regulation of gene activity and other cell processes because they are often observed near promoters, introns and specific untranslated regions. Unfortunately, the time complexity of algorithms for palindrome detection increases when mutations in the form of character insertions, deletions or substitutions are taken into consideration. In recent years, several works have been aimed at acceleration of such algorithms using dedicated circuits capable of potentially large-scale searching. However, widespread use of such circuits is often complicated by varying user task details or the need to use a specific target platform. The objective of this work is therefore to create a model of hardware architecture for approximate palindrome detection and develop a technique for automatic mapping of this model to the target platform without intervention of an experienced designer. The proposed model and the mapping technique are implemented and evaluated on a family of chips with Virtex5 technology.
[1]
Philip Heng Wai Leong,et al.
A Smith-Waterman Systolic Cell
,
2003,
FPL.
[2]
Tomás Martínek,et al.
NetCOPE: Platform for Rapid Development of Network Applications
,
2008,
2008 11th IEEE Workshop on Design and Diagnostics of Electronic Circuits and Systems.
[3]
Uzi Vishkin,et al.
Efficient Parallel and Serial Approximate String Matching
,
2011
.
[4]
Theerayod Wiangtong,et al.
International Conference on Field Programmable Technology
,
2006
.
[5]
Tomás Martínek,et al.
Hardware acceleration of approximate palindromes searching
,
2008,
2008 International Conference on Field-Programmable Technology.
[6]
L. Allison.
Finding Approximate Palindromes in Strings Quickly and Simply
,
2004,
ArXiv.
[7]
Martin C. Herbordt,et al.
Processing Repetitive Sequence Structures with Mismatches at Streaming Rate
,
2004,
FPL.
[8]
Mauricio Ayala-Rincón,et al.
A Modification of the Landau-Vishkin Algorithm Computing Longest Common Extensions via Suffix Arrays
,
2005,
BSB.