Low-complexity and highly robust barcodes for error-rich single molecular sequencing
© King Abdulaziz City for Science and Technology 2021..
DNA barcodes are frequently corrupted due to insertion, deletion, and substitution errors during DNA synthesis, amplification and sequencing, resulting in index hopping. In this paper, we propose a new DNA barcode construction scheme that combines a cyclic block code with a predetermined pseudo-random sequence bit by bit to form bit pairs, and then converts the bit pairs to bases, i.e., the DNA barcodes. Then, we present a barcode identification scheme for noisy sequencing reads, which uses a combination of cyclic shifting and traditional dynamic programming to mark the insertion and deletion positions, and then performs erasure-and-error-correction decoding on the corrupted codewords. Furthermore, we verify the identification error rate of barcodes for multiple errors and evaluate the reliability of the barcodes in DNA context. This method can be easily generalized for constructing long barcodes, which may be used in scenarios with serious errors. Simulation results show that the bit error rate after identifying insertions/deletions is greatly reduced using the combination of cyclic shift and dynamic programming compared to using dynamic programming only. It indicates that the proposed method can effectively improve the accuracy for estimating insertion/deletion errors. And the overall identification error rate of the proposed method is lower than 10 - 5 when the probability of each base mutation is less than 0.1, which is the typical scenario in third-generation sequencing.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2021 |
|---|---|
| Erschienen: |
2021 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:11 |
|---|---|
| Enthalten in: |
3 Biotech - 11(2021), 2 vom: 27. Feb., Seite 78 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Chen, Weigang [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
Barcode construction |
|---|
| Anmerkungen: |
Date Revised 02.02.2022 published: Print-Electronic Citation Status PubMed-not-MEDLINE |
|---|
| doi: |
10.1007/s13205-020-02607-5 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM320675548 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM320675548 | ||
| 003 | DE-627 | ||
| 005 | 20231225174102.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231225s2021 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s13205-020-02607-5 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n1068.xml |
| 035 | |a (DE-627)NLM320675548 | ||
| 035 | |a (NLM)33505833 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Chen, Weigang |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Low-complexity and highly robust barcodes for error-rich single molecular sequencing |
| 264 | 1 | |c 2021 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Revised 02.02.2022 | ||
| 500 | |a published: Print-Electronic | ||
| 500 | |a Citation Status PubMed-not-MEDLINE | ||
| 520 | |a © King Abdulaziz City for Science and Technology 2021. | ||
| 520 | |a DNA barcodes are frequently corrupted due to insertion, deletion, and substitution errors during DNA synthesis, amplification and sequencing, resulting in index hopping. In this paper, we propose a new DNA barcode construction scheme that combines a cyclic block code with a predetermined pseudo-random sequence bit by bit to form bit pairs, and then converts the bit pairs to bases, i.e., the DNA barcodes. Then, we present a barcode identification scheme for noisy sequencing reads, which uses a combination of cyclic shifting and traditional dynamic programming to mark the insertion and deletion positions, and then performs erasure-and-error-correction decoding on the corrupted codewords. Furthermore, we verify the identification error rate of barcodes for multiple errors and evaluate the reliability of the barcodes in DNA context. This method can be easily generalized for constructing long barcodes, which may be used in scenarios with serious errors. Simulation results show that the bit error rate after identifying insertions/deletions is greatly reduced using the combination of cyclic shift and dynamic programming compared to using dynamic programming only. It indicates that the proposed method can effectively improve the accuracy for estimating insertion/deletion errors. And the overall identification error rate of the proposed method is lower than 10 - 5 when the probability of each base mutation is less than 0.1, which is the typical scenario in third-generation sequencing | ||
| 650 | 4 | |a Journal Article | |
| 650 | 4 | |a Barcode construction | |
| 650 | 4 | |a Barcode identification | |
| 650 | 4 | |a DNA sequencing barcode deletions/insertions | |
| 700 | 1 | |a Wang, Panpan |e verfasserin |4 aut | |
| 700 | 1 | |a Wang, Lixia |e verfasserin |4 aut | |
| 700 | 1 | |a Zhang, Dalu |e verfasserin |4 aut | |
| 700 | 1 | |a Han, Mingzhe |e verfasserin |4 aut | |
| 700 | 1 | |a Han, Mingyong |e verfasserin |4 aut | |
| 700 | 1 | |a Song, Lifu |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t 3 Biotech |d 2011 |g 11(2021), 2 vom: 27. Feb., Seite 78 |w (DE-627)NLM217529119 |x 2190-572X |7 nnns |
| 773 | 1 | 8 | |g volume:11 |g year:2021 |g number:2 |g day:27 |g month:02 |g pages:78 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1007/s13205-020-02607-5 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 11 |j 2021 |e 2 |b 27 |c 02 |h 78 | ||