人類的DNA 藉由定序機器能夠分析出一長串由A、C、G、T 所組成的序列，不只是人類的DNA 序列被定序，其他物種的DNA 序列也逐一被定序完成，為了了解未知的生物訊息，透過兩條序列間的互相比對，判斷是否相同或是突變，來得知生物間不同情況時的狀態，進而對生物有更深一步的了解。
Burrows-Wheeler-transform 配合FM-index 使用，能夠節省空間，且速度快，常被寫成軟體來使用。隨著生物科技的快速發展，序列資料庫的數量不斷的上升，發展速度更超越摩爾定律，短短幾年內，大幅縮短了定序時間，所花費的成本也降低許多，在未來對於DNA 的需求只會更大，因此加快計算速度是研究的重要項目。
本實驗利用Vivado 套件將Burrows-Wheeler-transform 和FM-index寫至FPGA 上，並將兩條序列燒入至ROM 內，透過系統的控制中心，將兩條序列傳至運算模塊內進行比對，最後得知是否有比對成功，及顯示比對後的位置。

Human DNA can be analyzed into a long sequence of A, C, G, and T with sequencing machines. The sequences of not only human DNA but other species DNA have been sequenced. In order to understand the unknown biological information, scientists have contrasted two sequences. By determining whether the two sequences stay the same or mutated, they get to know the state of different situations between organisms, and further have a deeper understanding toward them.
Burrows-Wheeler-transform coupled with FM-index, which saves space and works fast, is usually written as software for use. With the rapid development of biotechnology, the number of sequence databases has continuously increased, and the development speed has even surpassed Moore's
Law. In just a few years, the sequencing time has been greatly shortened, and the cost has reduced significantly as well. In the future, the demand for DNA
will undoubtedly be greater; as a result, speeding up the calculation is an important project for research.
This experiment converts Burrows-Wheeler-transform and FM-index to the FPGA with the Vivado suite, and also converts two sequences into the ROM.Through the control center of the system, the two sequences are sent into
the operation module for comparison. The result indicates if they match each other, and their position after the comparison is done.

[ 1 ] Watson J, Crick F. Molecular structure of nucleic acids; a structure for deoxyribose nucleic acid (PDF). Nature. 1953
[ 2 ] Sanger F, Nicklen S, Coulson AR. DNA sequencing with chain-terminating inhibitors. Proceedings of the national academy of sciences, 1997, 74(12): 5463-5467
[ 3 ] Mardis ER. Next-generation DNA sequencing methods. Annu. Rev.Genomics Hum. Genet. 2008
[ 4 ] Sara Goodwin, John D. McPhersonW., Richard McCombie. Coming of age:ten years of next-generation sequencing technologies. Nature. 2016
[ 5 ] Bleidorn, Christoph. Third generation sequencing: technology and its potential
impact on evolutionary biodiversity research. 2016
[ 6 ] Wikipedia - Mutation
https://en.wikipedia.org/wiki/Mutation
[ 7 ] Jun‐Ichi Aoe ,Katsushi Morimoto ,Takashi Sato. An efficient implementation of trie structures.1992
[ 8 ] Weiner, P. Linear pattern matching algorithms.1973
[ 9 ] Farach, Martin . Optimal Suffix Tree Construction with Large Alphabets.1997
[ 10 ]Mohamed, IbrahimAbouelhodaa, StefanKurtzb, EnnoOhlebusch.Replacing Suffix Trees with Enhanced Suffix Arrays. 2004
[ 11]Roberto Grossi, Jeffrey Scott Vitter . Compressed Suffix Arrays And Suffix Trees With Applications To Text Indexing And String Matching.2005
[ 12 ] Heng Li, Richard Durbin. Fast and accurate short read alignment with Burrows–Wheeler transform.2009
[ 13 ] Dana Abdul Qader.A High Performance Architecture for an Exact Match Short-Read Aligner Using Burrows-Wheeler Aligner on FPGAs.2015
[ 14 ] Mostafa Morshedi,Hamid Noori. FPGA Implementation of a Short Read Mapping Accelerator.2017
[ 15 ] A.D.Baxevanis , B.F.F.Ouellette. Bioinformatics: A Practical Guide to the Analysis of Genes and Proteins. 1998
[ 16 ]Wikipedia - Suffix array https://en.wikipedia.org/wiki/Suffix_array
[ 17 ] Wikipedia - Read-only-memory
https://en.wikipedia.org/wiki/Read-only_memory
[ 18 ]Wikipedia - Finite-state-machine
https://en.wikipedia.org/wiki/Finite-state_machine
[ 19 ] U Meyer-Baese, U Meyer-Baese. Digital signal processing with field programmable gate arrays. 2007
[ 20 ] Wikipedia - Flip-flop
https://en.wikipedia.org/wiki/Flip-flop_(electronics)