Fan Peng
ABSTRACT
With the gradual deepening of human understanding of the disease and the continuous improvement of diagnosis and treatment, precision medicine, a new medical concept medical model, has been proposed. High-throughput and high-accuracy gene sequence reading and high-accuracy and rapid gene sequence alignment provide the basis for diagnosing and treating precision medicine. This paper presents a new method based on matrix and linked-list to store sequence information. The hash values of the two hash functions are used as the coordinate values of the sequence in the matrix, and they can be used to find the target sequence. The algorithm is compared with five classical comparison algorithms.
- Naibin Liu. Research on modularization of gene sequencing industrial organization in China [J]. Journal of Liaoning University of Technology (SOCIAL SCIENCE EDITION), 2020 (4).Google Scholar
- Kadri S , Long B C , Mujacic I , Clinical Validation of a Next-Generation Sequencing Genomic Oncology Panel via Cross-Platform Benchmarking against Established Amplicon Sequencing Assays[J]. Journal of Molecular Diagnostics, 2017, 19(1):43-56.Google ScholarCross Ref
- Chang Kai, Liu Chenxia, Xu Hongxuan, Overview of the development and application of gene sequencing in precision medicine [J]. Southwest Military Medicine, 23 (2): 3.Google Scholar
- MARDIS E R. The impact of next-generation sequencing technology on genetics[J]. Trends in Genetics, 2008,24(3):133-141.Google ScholarCross Ref
- Kai Xu. Optimizing High-throughput Biological Gene Sequencing Data Processing Algorithms based on Hash[D]. Jinan: Shandong University,2020:21-22.Google Scholar
- Zheng J, Zhang W Q, Luo J, Variant Map System to Simulate Complex Properties of DNA Interactions Using Binary Sequences[J]. Advances in Pure Mathematics, 2013, 3(7A):5-24.Google ScholarCross Ref
- Karp, Richard, M, Efficient randomized pattern-matching algorithms[J]. IBM Journal of Research and Development, 1987, 31(2):249-260.Google ScholarDigital Library
- Shulin Wang, Wang Ji, Chen Huang, Research on k-long DNA subsequence counting algorithm [J]. Computer Engineering, 2007 (09): 40-42.Google Scholar
- Jeffrey Zheng. Variant Construction from Theoretical Foundation to Applications[M]. Berlin: Springer Press, 2019:193-202.Google ScholarCross Ref
- Chu Hua. Software designer course (4th. ed.) [M]. Beijing: Tsinghua University Press, 2014: 435-436.Google Scholar
- Knuth, D. E. , Morris, J. H. , & Pratt, V. R. . (1977). Fast pattern matching in strings. Siam Journal on Computing, 6(2), 323-350.Google Scholar
- Boyer R.S., Moore J.S. A fast string searching algorithm. Communications of the ACM.20:762-772.Google ScholarDigital Library
- Sunday D.M.1990, A very fast substring search algorithm, Communications of the ACM. 33(8):132-142.Google Scholar
Index Terms
- New Hash-based Sequence Alignment Algorithm
Recommendations
Pairwise sequence alignment algorithms: a survey
ISTA '09: Proceedings of the 2009 conference on Information Science, Technology and ApplicationsPairwise sequence alignment is a fundamental compute-intensive problem in bioinformatics that has helped researchers analyse biological sequences. The analysis has helped biologists detect pathogens, develop drugs, and identify common genes. The ...
A simple algorithm for the constrained sequence problems
In this paper we address the constrained longest common subsequence problem. Given two sequences X, Y and a constrained sequence P, a sequence Z is a constrained longest common subsequence for X and Y with respect to P if Z is the longest subsequence of ...
Multiple sequence alignment using a GLOCSA guided genetic algorithm
GECCO '08: Proceedings of the 10th annual conference companion on Genetic and evolutionary computationThis paper introduces GLOCSA as a new scoring function to rate multiple sequence alignments. It is intended to be simple, considering the whole alignment at once and reflecting the parsimony of an alignment. Then, a GLOCSA Guided Genetic Algorithm is ...
Comments