z-logo
open-access-imgOpen Access
Exon sequencing mutation detection algorithm based on PCR matching
Author(s) -
Guobin Chen,
Xianzhong Xie
Publication year - 2020
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0236709
Subject(s) - primer (cosmetics) , dna sequencing , sequence (biology) , genetics , sequence analysis , exon , alignment free sequence analysis , biology , primer dimer , computational biology , polymerase chain reaction , gene , sequence alignment , peptide sequence , multiplex polymerase chain reaction , chemistry , organic chemistry
Background With the development of second-generation sequencing technology, more and more DNA sequence variations have been detected. Exon sequencing is the first choice for sequencing many cancer genes, and it can be better used to identify disease status by detecting gene variants. PCR sequence is an effective method to capture that sequence of an exon in the process of sequencing. Exon sequencing sequence contains PCR primer sequence, the correct position of the sequence can be determined by PCR primer sequence, which can be found in SNP, Indel mutation point by comparing the sequence of PCR primer sequence. Results In this paper, a matching algorithm based on the PCR primer sequence is proposed, which can effectively sequence the position of PCR primer sequence and find out the key position sequence. Then the sequencing sequence is sorted and the number of the same sequence is counted to reduce the matching times. Then, the sequenced sequence was matched with PCR primer sequence, so that the DNA position could be accurately matched and the variation in the sequenced sequence could be found more quickly. Conclusions Compared with the traditional sequence matching method, PCR primer sequence matching method can match many sequences and find more variation. It also showed a high recall rate in the recall rate.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here