Accelerating the Retrieval Efficiency of Biological Genes Based on Cached Trie Tree

with the rapid development of the third generation sequencing technology and the rapid growth of biological sequence data such as DNA, how to efficiently retrieve a gene cluster from it is a major challenge. This paper mainly introduces the acceleration of DNA gene sequence retrieval based on trie. The use of database to retrieve huge gene sequence clusters has encountered a bottleneck in performance, and the retrieval efficiency is becoming more and more slow. When faced with millions of data, it takes a minute to query a gene cluster. When we build a biological gene database, it takes 1-2 minutes to query the matched genes, which is extremely inefficient for user experience or scientific research retrieval. This paper introduces a reasonable use of memory space to build a trie tree with cache to speed up the retrieval of gene sequences.