New Hash-based Sequence Alignment Algorithm
Pages 184 - 190
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.
References
[1]
Naibin Liu. Research on modularization of gene sequencing industrial organization in China [J]. Journal of Liaoning University of Technology (SOCIAL SCIENCE EDITION), 2020 (4).
[2]
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.
[3]
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.
[4]
MARDIS E R. The impact of next-generation sequencing technology on genetics[J]. Trends in Genetics, 2008,24(3):133-141.
[5]
Kai Xu. Optimizing High-throughput Biological Gene Sequencing Data Processing Algorithms based on Hash[D]. Jinan: Shandong University,2020:21-22.
[6]
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.
[7]
Karp, Richard, M, Efficient randomized pattern-matching algorithms[J]. IBM Journal of Research and Development, 1987, 31(2):249-260.
[8]
Shulin Wang, Wang Ji, Chen Huang, Research on k-long DNA subsequence counting algorithm [J]. Computer Engineering, 2007 (09): 40-42.
[9]
Jeffrey Zheng. Variant Construction from Theoretical Foundation to Applications[M]. Berlin: Springer Press, 2019:193-202.
[10]
Chu Hua. Software designer course (4th. ed.) [M]. Beijing: Tsinghua University Press, 2014: 435-436.
[11]
Knuth, D. E., Morris, J. H., & Pratt, V. R. . (1977). Fast pattern matching in strings. Siam Journal on Computing, 6(2), 323-350.
[12]
Boyer R.S., Moore J.S. A fast string searching algorithm. Communications of the ACM.20:762-772.
[13]
Sunday D.M.1990, A very fast substring search algorithm, Communications of the ACM. 33(8):132-142.
Recommendations
Sequence Similarity Alignment Algorithm in Bioinformatics: Techniques and Challenges
Advances in Brain Inspired Cognitive SystemsAbstractSequence similarity alignment is a basic information processing method in bioinformatics. It is very important for discovering the information of function, structure and evolution in biological sequences. The main idea is to use a specific ...
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 ...
DNA Sequence Alignment Method Based on Trilateration
Bioinformatics and Biomedical EngineeringAbstractThe effective comparison of biological data sequences is an important and a challenging task in bioinformatics. The sequence alignment process itself is a way of arranging DNA sequences in order to identify similar areas that may have a ...
Comments
Information & Contributors
Information
Published In
January 2022
551 pages
ISBN:9781450395755
DOI:10.1145/3523286
Copyright © 2022 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 31 May 2022
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
BIC 2022
BIC 2022: 2022 2nd International Conference on Bioinformatics and Intelligent Computing
January 21 - 23, 2022
Harbin, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 34Total Downloads
- Downloads (Last 12 months)8
- Downloads (Last 6 weeks)1
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format