Study of the error correction capability of multiple sequence alignment algorithm (MAFFT) in DNA storage
Open accessAbstract
Synchronization (insertions–deletions) errors are still a major challenge for reliable information retrieval in DNA storage. Unlike traditional error correction codes (ECC) that add redundancy in the stored information, multiple sequence alignment (MSA) solves this problem by searching the conserved subsequences. In this paper, we conduct a comprehensive simulation study on the error correction capability of a typical MSA algorithm, MAFFT. Our results reveal that its capability exhibits a phase transition when there are around 20% errors. Below this critical value, increasing sequencing depth can eventually allow it to approach complete recovery. Otherwise, its performance plateaus at some poor levels. Given a reasonable sequencing depth (≤ 70), MSA could achieve complete recovery in the low error regime, and effectively correct 90% of the errors in the medium error regime. In addition, MSA is robust to imperfect clustering. It could also be combined with other means such as ECC, repeated markers, or any other code constraints. Furthermore, by selecting an appropriate sequencing depth, this strategy could achieve an optimal trade-off between cost and reading speed. MSA could be a competitive alternative for future DNA storage.
AI snapshot
Written from the paper’s full text.
TL;DR
This paper simulates the error-correction capability of the MSA algorithm MAFFT for DNA storage and finds a phase transition at about 20% errors. Below this limit, MAFFT can approach complete recovery with sufficient sequencing depth; above it, performance plateaus poorly.
Key findings
- MAFFT’s recovery accuracy shows a phase transition at roughly 20% errors: below this critical value, increasing sequencing depth can improve recovery; above it, recovery accuracy drops steeply and increasing depth does not help.
- In the low error regime (p ≤ 8%), MAFFT can completely recover data; at p = 8%, it needs only 70 reads. In the medium regime (8% < p ≤ 15%), it can correct more than 90% of errors with sequencing depth ≤ 100.
- At 13% error, increasing accuracy from 90% to 95% requires sequencing depth rising from 30 to 35, while improving from 95% to 99% requires 35 to 60 reads.
- MAFFT is robust to imperfect clustering: with cluster accuracy as low as 0.6, average recovery accuracy remained greater than 0.95 at 10%, 12%, and 14% error rates. On a real nanopore dataset, MAFFT completely recovered about 92% of sequences at sequencing depth 20.
Methods
- Simulation study: a text file (“The Grandmother”) was encoded with quaternary mapping (00-A, 01-T, 10-G, 11-C) into 140 DNA sequences of 120 bases (8 bases index, 112 bases data). Error rate p ranged from 1% to 40%, sequencing depth up to 4000, with average results from 100 repeated experiments.
- MAFFT (FFT-NS-2) was used as the MSA algorithm; IDS errors were assumed uniformly random, and all reads were assumed correctly clustered in the main simulation.
- Real dataset test used a Microsoft nanopore dataset with 10,000 DNA sequences of length 110 and 269,709 noisy nanopore reads; estimated insertion, deletion, and substitution rates were about 1.7%, 2%, and 2.2%, respectively. Recovery was assessed by average recovery accuracy and normalized Hamming distance.
Limitations
- The paper states that simulation assumes all reads are clustered correctly and that IDS errors are uniformly random; in reality, error location and type are influenced by GC content, homopolymers, and reserved subsequences.
- The paper notes that if a base is deleted in all reads, MSA alone cannot recover it, and that homopolymers cause more trouble for MSA.
- The study uses MAFFT as a proof-of-concept for MSA generally; the authors believe results largely apply to other MSA algorithms, but this is not directly tested.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
0 of 14 cited sources checked · 0 supported · 0 flagged
- Findingown data
A significant portion of errors remain synchronization errors even with increased sequencing depth.
“We observe that a significant portion of errors are still synchronization errors even with increased sequencing depth.”
Quote in the paperSubstantial claim - Findingown data
MAFFT's error correction capability exhibits a phase transition at around 20% errors.
“Our results reveal that its capability exhibits a phase transition when there are around 20% errors.”
- Also stated in: § The phase transition of the error correction capability · hedged
“Results indicate that MAFFT's error correction capability exhibits a phase transition. Figure 1 shows two phase transitions of the average recovery accuracy at two I:D:S ratios (1:1:1(a) and 1:1:2(b)), and the critical value is at about 20% error.”
- Also stated in: § Conclusion · hedged
“Our simulation results indicate that its error correction limit is about 20% errors.”
Quote in the paperSubstantial claim - Also stated in: § The phase transition of the error correction capability · hedged
- Findingown data
The average recovery accuracy at I:D:S ratio 1:1:1 is lower than that at I:D:S ratio 1:1:2.
“Under the same conditions in Fig. 1a, b, we can see that the average recovery accuracy at I:D:S ratio 1:1:1 is lower than that of I:D:S ratio 1:1:2.”
Quote in the paperSubstantial claim - Findingown data
Below the critical error rate of about 20%, increasing sequencing depth can eventually allow MAFFT to approach complete recovery.
“Below this critical value, increasing sequencing depth can eventually allow it to approach complete recovery.”
- Also stated in: § The phase transition of the error correction capability · hedged
“When the error rate is less than the critical value, increasing sequencing depth may improve the average recovery rate (see the lower red region in Fig. 1).”
Quote in the paperSubstantial claim - Also stated in: § The phase transition of the error correction capability · hedged
- Findingown data
In the medium error regime, the needed sequencing depth to reach higher accuracy increases dramatically at a given error rate.
“The various curves in Fig. 2b show that, at a given error rate, the needed sequencing depth to reach higher accuracy increases dramatically.”
Quote in the paperSubstantial claim
- Findingown data
In the low error regime, the required sequencing depth for 100% recovery accuracy increases approximately linearly as the error rate increases.
“The red curve in Fig. 2b shows the required sequencing depth for 100% recovery accuracy. In this regime, it increases approximately linearly as the error rate increases.”
Quote in the paperSubstantial claim - Findingown data
MSA is robust to imperfect clustering.
“In addition, MSA is robust to imperfect clustering.”
- Also stated in: § Impact of clustering accuracy · plain
“The error correction capability of MAFFT is robust to imperfect clustering.”
Quote in the paperSubstantial claim - Also stated in: § Impact of clustering accuracy · plain
- Findingreasoning
Increasing sequencing depth beyond 60 has negligible effect on correcting the few remaining indels.
“This suggests that increasing sequencing depth beyond 60 seems to have negligible effect on correcting the few remaining indels.”
Quote in the paperSubstantial claim - Findingown data
In the low error regime, with sequencing depth at most 70, MSA can achieve complete recovery.
“Given a reasonable sequencing depth (≤ 70), MSA could achieve complete recovery in the low error regime, and effectively correct 90% of the errors in the medium error regime.”
- Also stated in: § The error correction capability · plain
“In the low error regime, MAFFT can completely recover the data.”
- Also stated in: § The error correction capability · plain
“At p = 8%, MAFFT only needs 70 reads.”
Quote in the paperSubstantial claim - Also stated in: § The error correction capability · plain
- Findingown data
At p = 8%, MAFFT only needs 70 reads for complete recovery.
“At p = 8%, MAFFT only needs 70 reads.”
Quote in the paperSubstantial claim - Findingown data
MAFFT could correct more than 95% of the errors at sequencing depth 100 when the error rate is below 15%.
“Generally, MAFFT could correct more than 95% of the errors at sequencing depth 100 when the error rate is below 15%.”
Quote in the paperSubstantial claim - Findingown data
In the medium error regime, MSA can effectively correct 90% of the errors.
“Given a reasonable sequencing depth (≤ 70), MSA could achieve complete recovery in the low error regime, and effectively correct 90% of the errors in the medium error regime.”
- Also stated in: § The error correction capability · plain
“In the medium error regime, MAFFT can correct more than 90% of the errors with a modest sequencing depth (≤ 100).”
Quote in the paperSubstantial claim - Also stated in: § The error correction capability · plain
- Findingown data
MAFFT could correct most errors in the real nanopore dataset with only modest sequencing depth.
“MAFFT could correct most of the errors in these sequences with only modest sequencing depth.”
Quote in the paperSubstantial claim - Findingown data
In the real dataset, most errors are caused by only a few indels.
“Although the normalized Hamming distance may range from 0 to 0.8, most errors are caused by only a few indels.”
Quote in the paperNot a substantial claim - Findingown data
Some sequences in the real dataset could not be completely recovered even with increased sequencing depth.
“On the other hand, there are still some sequences which could not be completely recovered even with increased sequencing depth.”
Quote in the paperSubstantial claim - Findingown data
At sequencing depth 20, MAFFT could completely recover about 92% of sequences in the real dataset.
“The leftmost bar in Fig. 4b indicates that MAFFT could completely recover about 92% of these sequences.”
Quote in the paperSubstantial claim - Interpretationreasoning
MSA may be a crucial part of the optimal solution to reliable, fast, and low-cost DNA storage in the low error regime.
“Therefore, MSA may be a crucial part of the optimal solution to a reliable, fast, and low-cost DNA storage application in the low error regime.”
Quote in the paperSubstantial claim - Interpretationown data
The more insertions/deletions (indels) in sequenced reads, the harder it is to solve the synchronization problem.
“This is coincident with our intuition that assuming a successful synthesis, the more insertions/deletions (indels) in the sequenced reads, the harder it is to solve the synchronization problem.”
Quote in the paperSubstantial claim- The authors state this as an assumption: A successful synthesis is assumed when considering the effect of indels on the synchronization problem.
- Interpretationown data
MSA could be a competitive alternative for future DNA storage.
“MSA could be a competitive alternative for future DNA storage.”
- Also stated in: § Conclusion · hedged
“In sum, we believe that MSA would be a competitive paradigm in the low and medium error regimes for future DNA storage application.”
Quote in the paperNot a substantial claim - Also stated in: § Conclusion · hedged
- Interpretationreasoning
The results found are still largely applicable to other MSA algorithms.
“Although we only used MAFFT as a proof-of-concept of MSA’s error correction capability, we believe that the results we found are still largely applicable to other MSA algorithms.”
Quote in the paperNot a substantial claim - Interpretationreasoning
In the medium error regime, MSA aided with other means is a competitive solution.
“In the medium error regime, MSA aided with other means is a competitive solution.”
Quote in the paperSubstantial claim - Interpretationreasoning
The medium error regime is suitable for ordinary storage applications where third-generation synthesis and sequencing technologies could be used.
“This regime is suitable for ordinary storage applications where the third-generation synthesis and sequencing technologies could be used.”
Quote in the paperSubstantial claim - Interpretationreasoning
MSA has more trouble dealing with errors introduced by homopolymers, perhaps due to the nature of the algorithm.
“And it seems that MSA has more trouble dealing with errors introduced by homopolymers, perhaps due to the nature of the algorithm.”
Quote in the paperSubstantial claim- Rests on an assumption: Homopolymers tend to introduce more IDS errors.
- Interpretationreasoning
MAFFT's performance is a fair approximation of MSA algorithms' overall error correction capability.
“Therefore, we believe that MAFFT’s performance is a fair approximation of MSA algorithms’ overall error correction capability.”
Quote in the paperSubstantial claim - Premisecitation
Antkowiak et al.'s method has a logical density of 0.8 bits/nt.
“Moreover, its logical density (1.75 bits/nt) is double that of Antkowiak et al.’s method (0.8 bits/nt) [20] with only about 2.5% reduction in error correction capability.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [20] Antkowiak PL, Lietard J, Darestani MZ, Somoza MM, Stark WJ, Heckel R, Grass RN. Low cost DNA data storage using photolithographic synthesis and advanced information reconstruction and error correction. Nat Commun. 2020;11(1):5345. source
Not checked in the free run.
- Interpretationreasoning
If a base was deleted in all reads, MSA alone has no way to recover it.
“The downside is that if a base was deleted in all the reads, which does have a non-negligible probability of occurring during synthesis, MSA alone has no way to recover it.”
Quote in the paperSubstantial claim- Rests on an assumption: A base deletion in all reads has a non-negligible probability of occurring during synthesis.
- Interpretationreasoning
MSA is suitable for applications where second-generation synthesis and sequencing technologies are used.
“Therefore, MSA is suitable for applications where second-generation synthesis and sequencing technologies are used.”
Quote in the paperSubstantial claim - Premisecitation
Yazdi et al.'s method has the most cost-efficient solution in the medium error regime.
“Compared with other methods in this regime, Yazdi et al. [21] has the most cost-efficient solution.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [21] Yazdi SMHT, Gabrys R, Milenkovic O. Portable and error-free DNA-based data storage. Sci Rep. 2017;7:6. source
Not checked in the free run.
- Premisecitation
Yazdi et al.'s method has a logical density of 1.75 bits/nt.
“Moreover, its logical density (1.75 bits/nt) is double that of Antkowiak et al.’s method (0.8 bits/nt) [20] with only about 2.5% reduction in error correction capability.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [21] Yazdi SMHT, Gabrys R, Milenkovic O. Portable and error-free DNA-based data storage. Sci Rep. 2017;7:6. source
Not checked in the free run.
- cites [20] Antkowiak PL, Lietard J, Darestani MZ, Somoza MM, Stark WJ, Heckel R, Grass RN. Low cost DNA data storage using photolithographic synthesis and advanced information reconstruction and error correction. Nat Commun. 2020;11(1):5345. source
Not checked in the free run.
- Interpretationreasoning
MSA would be a competitive paradigm in the low and medium error regimes for future DNA storage application.
“In sum, we believe that MSA would be a competitive paradigm in the low and medium error regimes for future DNA storage application.”
Quote in the paperSubstantial claim - Interpretationreasoning
In the medium error regime, a potential alternative is to apply MSA algorithm aided by other means to achieve a relatively high logical density.
“In the medium error regime, a potential alternative is to apply MSA algorithm aided by other means to achieve a relatively high logical density.”
Quote in the paperSubstantial claim - Interpretationreasoning
Constraining the length of homopolymers may reduce such errors for MSA.
“Therefore, constraining the length of homopolymers may reduce such errors for MSA.”
Quote in the paperSubstantial claim - Premisecitation
Yazdi et al.'s method has only about 2.5% reduction in error correction capability compared to Antkowiak et al.'s method.
“Moreover, its logical density (1.75 bits/nt) is double that of Antkowiak et al.’s method (0.8 bits/nt) [20] with only about 2.5% reduction in error correction capability.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [20] Antkowiak PL, Lietard J, Darestani MZ, Somoza MM, Stark WJ, Heckel R, Grass RN. Low cost DNA data storage using photolithographic synthesis and advanced information reconstruction and error correction. Nat Commun. 2020;11(1):5345. source
Not checked in the free run.
- cites [21] Yazdi SMHT, Gabrys R, Milenkovic O. Portable and error-free DNA-based data storage. Sci Rep. 2017;7:6. source
Not checked in the free run.
- Interpretationreasoning
MSA can maximally utilize reads' information even if they contain some noises.
“That is, MSA could maximally utilize the reads’ information, even if they contain some noises.”
Quote in the paperSubstantial claim - Interpretationreasoning
Since the modulation-based method uses a carrier strand to directly align sequenced reads, MSA is not needed in the high error regime.
“Since it uses a carrier strand to directly align the sequenced reads, MSA is thus not needed anymore.”
Quote in the paperSubstantial claim - Interpretationreasoning
Non-random location and type of errors could lead to decreased error correction capability of MSA.
“This could lead to decreased error correction capability of MSA.”
Quote in the paperNot a substantial claim- Rests on an assumption: The location and type of errors are not purely random, as they can be influenced by various error sources (GC content, homopolymers, reserved subsequences).
- Premisecitation
MAFFT (FFT-NS-2) was used as a proof of concept because of its good accuracy and quasi-linear time for pairwise comparison.
“In this paper, we use a MSA software, MAFFT (FFT-NS-2), as a proof of concept on MSA’s error correction capability because of its good accuracy and quasi-linear time for pairwise comparison [29].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [29] Pervez MT, Babar ME, Nadeem A, Aslam M, Awan AR, Aslam N, Hussain T, Naveed N, Qadri S, Waheed U, et al. Evaluating the accuracy and efficiency of multiple sequence alignment methods. Evolut Bioinform. 2014;10:19199. source
Not checked in the free run.
- May combine two claims. 21
- Classified as probably not a substantial claim. 11
May combine two claims.
Findingown dataAbove the critical error rate of about 20%, MAFFT's recovery accuracy drops steeply to less than 50% in most cases and increasing sequencing depth cannot improve it.
“Otherwise, its performance plateaus at some poor levels.”
- Also stated in: § The phase transition of the error correction capability · plain
“On the contrary, the recovery accuracy drops steeply to even less than 50% in most cases when the error rate is larger than the critical value. And increasing sequencing depth could not improve the recovery accuracy (see the upper blue region in Fig. 1).”
Quote in the paperSubstantial claim- Also stated in: § The phase transition of the error correction capability · plain
May combine two claims.
Findingown dataAt error rate 13%, improving accuracy from 90% to 95% requires increasing sequencing depth from 30 to 35; improving from 95% to 99% requires increasing from 35 to 60.
“For example, at error rate 13%, to improve the accuracy from 90 to 95%, the needed sequence only increases from 30 to 35. However, this number increases from 35 to 60 in order to improve the accuracy from 95 to 99%.”
Quote in the paperSubstantial claimMay combine two claims.
FindingreasoningMSA can handle 99% and 95% of the errors at p = 12% and 14%, respectively, with needed sequencing depth about 50.
“For example, we could let MSA handle 99% and 95% of the errors at p = 12% and 14%, where the needed sequencing depth is about 50.”
Quote in the paperSubstantial claimMay combine two claims.
FindingreasoningIn the clustering accuracy experiment, average recovery accuracy slightly decreased when noisy reads were added, but remained greater than 0.95 even when clustering accuracy was as low as 0.6.
“Although the average recovery accuracy slightly decreased when we added noisy reads, they are all still greater than 0.95 even when the clustering accuracy is as low as 0.6.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataMost errors in the real dataset usually occur when there are homopolymers, which are highly prevalent in this dataset.
“In addition, we find that most of these errors usually occur when there are homopolymers, such as the example in Fig. 4c, which are highly prevalent in this dataset.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataIn the real dataset, one typical alignment error was caused by a deletion of base G in most reads, and another by misaligning some base C to the next position.
“The first one is caused by a deletion of base ‘G’ in most reads. The second one is caused by misaligning some base C to the next position.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationnone givenBy selecting an appropriate sequencing depth, the MSA strategy can achieve an optimal trade-off between cost and reading speed.
“Furthermore, by selecting an appropriate sequencing depth, this strategy could achieve an optimal trade-off between cost and reading speed.”
Quote in the paperNot a substantial claim- Rests on an assumption: The main cost in DNA storage comes from synthesis.
- Rests on an assumption: Retrieval efficiency is mainly determined by the average sequencing depth and decoding time complexity.
Probably not a substantial claim: may not pass S2 (checkable).
InterpretationreasoningMSA can be combined with other means such as ECC, repeated markers, or any other code constraints.
“It could also be combined with other means such as ECC, repeated markers, or any other code constraints.”
- Also stated in: § The error correction capability · hedged
“Therefore, it would be a wise alternative to combine MSA with other means, such as markers, ECC, or constraints on encoding.”
Quote in the paperNot a substantial claim- Also stated in: § The error correction capability · hedged
May combine two claims.
InterpretationreasoningIf most errors are solved by MSA, added redundancy will be significantly reduced and a relatively high logical density approaching 2 bits/nt can still be achieved.
“As most of these errors are solved by MSA, the added redundancy will be significantly reduced and thus still achieve a relatively high logical density approaching 2 bits/nt.”
Quote in the paperSubstantial claimMay combine two claims.
InterpretationreasoningSince simple quaternary encoding and constraints were used, MAFFT can achieve complete recovery with reasonably little copies and minimal loss in logical density.
“Since we only used the simple quaternary encoding and constraints, this means that MAFFT can achieve complete recovery with reasonably little copies and minimal loss in logical density.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationown dataThe needed sequencing depth and logical redundancy of Yazdi et al.'s method could be further optimized.
“From our results in Fig. 2b, the needed sequencing depth and logical redundancy of this method could be further optimized.”
Quote in the paperNot a substantial claimMay combine two claims.
PremisecitationIn the high error regime, the modulation-based method proposed by our group is perhaps the best solution today, as it could correct up to 40% errors.
“In the high error regime, the modulation-based method proposed by our group is perhaps the best solution today, as it could correct up to 40% errors.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [19] Zan X, Xie R, Yao X, Xu P, Liu W. A robust and efficient DNA storage architecture based on modulation encoding and decoding. bioRxiv 2022. source
Not checked in the free run.
May combine two claims.
InterpretationreasoningThe post-alignment voting process can retain conserved information and filter out most noises, explaining robustness to imperfect clustering.
“This may be explained by the post-alignment voting process’s ability to retain the conserved information and filter out most of the noises.”
Quote in the paperSubstantial claimMay combine two claims.
Premisenone givenBoth the error correction capability and logical density of the modulation-based method are superior to the method proposed by Lenz et al.
“Both of its error correction capability and logical density are superior to the method proposed by Lenz et al. [16].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [16] Lenz A, Maarouf I, Welter L, Wachter-Zeh A, Amat A. Concatenated codes for recovery from multiple reads of DNA sequences. 2020.
Not checked in the free run.
Probably not a substantial claim: may not pass S4 (based). May combine two claims.
Interpretationnone givenMSA requires no redundancy, which is crucial for high logical density.
“First, it requires no redundancy which is crucial for high logical density.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based). May combine two claims.
Interpretationnone givenMSA's decoding process is quasi-linear, which is beneficial for efficient information retrieval.
“Second, its decoding process is quasi-linear which is beneficial for efficient information retrieval.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
InterpretationreasoningA more accurate MSA algorithm, such as SATe, while slower, would most likely require less sequencing depth to achieve the same recovery rate as MAFFT.
“A more accurate MSA algorithm, such as SATe, while slower, would most likely require less sequencing depth to achieve the same recovery rate as MAFFT.”
Quote in the paperNot a substantial claimMay combine two claims.
InterpretationreasoningIn the low error regime, MSA alongside the simplest encoding and constraints is perhaps the optimal choice: it achieves complete recovery with minimal loss in logical density while requiring only quasi-linear time complexity and modest sequencing depth.
“In the low error regime, MSA alongside the simplest encoding and constraints is perhaps the optimal choice: it achieves complete recovery with minimal loss in logical density while requiring only quasi-linear time complexity and modest sequencing depth.”
Quote in the paperSubstantial claimMay combine two claims.
InterpretationreasoningMSA can solve most IDS errors using the simplest quaternary encoding (minimal loss of logical density) while requiring only modest sequencing depths.
“The main advantage of MSA is that it can solve most of the IDS errors using the simplest quaternary encoding (minimal loss of logical density) while requiring only modest sequencing depths.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S2 (checkable), S4 (based).
Interpretationnone givenMSA can be combined with other means to provide a flexible architecture to design an MSA-dominated error correcting mechanism.
“Lastly, it can be combined with other means to provide a flexible architecture to design a MSA-dominated error correcting mechanism.”
Quote in the paperNot a substantial claimMay combine two claims.
InterpretationreasoningA more accurate MSA algorithm is unlikely to have a higher practical error correction limit, since sequencing depth in the thousands would be even more infeasible for accurate but slower algorithms.
“It is also unlikely to have a higher practical error correction limit, since a sequencing depth in the thousands would be even more infeasible for these accurate but much slower algorithms.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationown dataA base deletion in most reads is irrecoverable by MSA, while misalignment may be improved by increasing sequencing depth.
“Obviously, the former could not be solved because a base deletion in most reads would be irrecoverable by MSA, while the latter may be improved by increasing sequencing depth.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationown dataIn the low error regime, MSA could accomplish complete recovery while retaining maximum logical density.
“In the low error regime, MSA could accomplish complete recovery while retaining maximum logical density.”
Quote in the paperSubstantial claimMay combine two claims.
PremisecitationThe error rate of second-generation synthesis and sequencing technology is less than 5%, while that of third-generation is about 10-15%.
“The error rate of the second-generation synthesis and sequencing technology is less than 5%, while that of the third-generation is about 10–15% [31, 32].”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [31] Lopez R, Chen Y-J, Dumas Ang S, Yekhanin S, Makarychev K, Racz MZ, Seelig G, Strauss K, Ceze L. DNA assembly for nanopore data storage readout. Nat Commun. 2019;10(1):2933. source
Not checked in the free run.
- cites [32] Jain M, Tyson JR, Loose M, Ip CLC, Eccles DA, O’Grady J, Malla S, Leggett RM, Wallerman O, Jansen HJ, et al. MinION analysis and reference consortium: phase 2 data release and analysis of R90 chemistry. F1000Res. 2017;6:760–760. source
Not checked in the free run.
Classified as probably not a substantial claim.
Study design and conductnone givenFor each error rate and sequencing depth, the average results were obtained from 100 repeated experiments.
“For each error rate and sequencing depth, the average results are obtained from 100 repeated experiments.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
PremisecitationBy default, MAFFT chooses FFT-NS-2, the strategy optimized for speed, which is on par with the fastest MSA algorithms.
“By default, it chooses FFT-NS-2, the strategy optimized for speed, which is on par with the fastest MSA algorithms [29].”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [29] Pervez MT, Babar ME, Nadeem A, Aslam M, Awan AR, Aslam N, Hussain T, Naveed N, Qadri S, Waheed U, et al. Evaluating the accuracy and efficiency of multiple sequence alignment methods. Evolut Bioinform. 2014;10:19199. source
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationMAFFT also provides strategies that are state-of-the-art in terms of alignment accuracy, such as L-INS-i, which is comparable to the most accurate algorithms.
“But it also provides strategies that are state-of-the-art in terms of alignment accuracy, such as L-INS-i [29], which is comparable to the most accurate algorithms.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [29] Pervez MT, Babar ME, Nadeem A, Aslam M, Awan AR, Aslam N, Hussain T, Naveed N, Qadri S, Waheed U, et al. Evaluating the accuracy and efficiency of multiple sequence alignment methods. Evolut Bioinform. 2014;10:19199. source
Not checked in the free run.
May combine two claims.
PremisecitationMAFFT has good accuracy and takes only quasi-linear time for pairwise comparison.
“MAFFT has good accuracy and takes only quasi-linear time for pairwise comparison.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [29] Pervez MT, Babar ME, Nadeem A, Aslam M, Awan AR, Aslam N, Hussain T, Naveed N, Qadri S, Waheed U, et al. Evaluating the accuracy and efficiency of multiple sequence alignment methods. Evolut Bioinform. 2014;10:19199. source
Not checked in the free run.
Probably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductown dataIn the clustering accuracy experiment, average recovery accuracy at 10%, 12%, and 14% error rates was obtained after repeating the experiment 500 times.
“Additionally, Fig. 3 shows the average recovery accuracy at 10%, 12%, and 14% error rates after repeating the experiment 500 times.”
Quote in the paperNot a substantial claim
The authors state this as an assumption.
The location and type of base errors introduced in synthesis and sequencing are random, so IDS errors are distributed uniformly at random.
“While there are specific patterns where error occurrence is more likely, for simplicity, we assume the location and type of base errors introduced in synthesis and sequencing are random. Hence, the IDS errors are distributed uniformly at random.”
The authors state this as an assumption.
All reads have been clustered correctly.
“For simulation experiments, we assume that all reads have been clustered correctly and we focus on the reconstruction problem of these clustered sequences using MAFFT.”
The authors state this as an assumption.
A successful synthesis is assumed when considering the effect of indels on the synchronization problem.
“This is coincident with our intuition that assuming a successful synthesis, the more insertions/deletions (indels) in the sequenced reads, the harder it is to solve the synchronization problem.”
The paper relies on this without support.
Homopolymers tend to introduce more IDS errors.
“It is well-known that homopolymers tend to introduce more IDS errors.”
The paper relies on this without support.
The location and type of errors are not purely random, as they can be influenced by various error sources (GC content, homopolymers, reserved subsequences).
“Furthermore, the location and type of errors are not purely random, as they can be influenced by various error sources (GC content, homopolymers, reserved subsequences).”
The paper relies on this without support.
A base deletion in all reads has a non-negligible probability of occurring during synthesis.
“The downside is that if a base was deleted in all the reads, which does have a non-negligible probability of occurring during synthesis, MSA alone has no way to recover it.”
The paper relies on this without support.
MSA is a parameter-free error correction method whose performance is determined by the sequence copies used (or sequencing depth).
“MSA is a parameter-free error correction method whose performance is determined by the sequence copies used (or sequencing depth).”
The paper relies on this without support.
The main cost in DNA storage comes from synthesis.
“The main cost in DNA storage comes from synthesis.”
The paper relies on this without support.
Retrieval efficiency is mainly determined by the average sequencing depth and decoding time complexity.
“On the other hand, retrieval efficiency is mainly determined by the average sequencing depth and decoding time complexity.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Adequately deep sequencing combined with MSA is able to correct errors when their frequency is less than 20%; above this value, error correction based on MSA is possible with simultaneous use of ECC.
“The authors showed that adequately deep sequencing combined with MSA is able to correct errors when their frequency is less than 20%. Above this value, error correction based on MSA is possible with the simultaneous use of ECC.”
From DNA Data Storage. (2023) · cites this paper as [34]
The Results section, “The phase transition of the error correction capability” (page unavailable), says that below about 20% errors, greater sequencing depth can improve recovery. It also says that above this threshold MSA cannot capture useful information; the paper proposes combining MSA with ECC for the medium error regime, with examples at 12% and 14%, not for errors above 20%. (LLM, conf=0.88)
Experimental — accuracy not yet measuredXie et al. (2023) showed that the MAFFT algorithm can correct more than 95% of errors at a sequencing depth reaching 100× when the error rate is lower than 15%.
“The MAFFT algorithm was chosen for the analysis, which has been shown to be able to correct more than 95% of errors at a sequencing depth reaching 100× when the error rate is lower than 15%.”
From DNA Data Storage. (2023) · cites this paper as [34]
Cites
MAFFT Multiple Sequence Alignment Software Version 7: Improvements in Performance and Usability
Katoh, K., & Standley, D. M. (2013) · Molecular Biology and Evolution · doi:10.1093/molbev/mst010 · Cited by 46,209 · see citing works
MUSCLE: multiple sequence alignment with high accuracy and high throughput
Edgar, R. C. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh340 · Cited by 44,662 · see citing works
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288 · see citing works
ProbCons: Probabilistic consistency-based multiple sequence alignmentPreprint
Do, C. B., Mahabhashyam, M. S. P., Brudno, M., & Batzoglou, S. (2005) · Genome Research · doi:10.1101/gr.2821705 · Cited by 1,103 · see citing works
DNA Fountain enables a robust and efficient storage architecture
Erlich, Y., & Zielinski, D. (2017) · Science · doi:10.1126/science.aaj2038 · Cited by 898 · see citing works
Robust Chemical Preservation of Digital Information on DNA in Silica with Error-Correcting Codes
Grass, R. N., Heckel, R., Puddu, M., Paunescu, D., & Stark, W. J. (2015) · Angewandte Chemie International Edition · doi:10.1002/anie.201411378 · Cited by 754 · see citing works
Portable and Error-Free DNA-Based Data Storage
Yazdi, S. M. H. T., Gabrys, R., & Milenkovic, O. (2017) · Scientific Reports · doi:10.1038/s41598-017-05188-1 · Cited by 361 · see citing works
Liu, K., Warnow, T. J., Holder, M. T., Nelesen, S. M., Yu, J., Stamatakis, A., & Linder, C. R. (2011) · Systematic Biology · doi:10.1093/sysbio/syr095 · Cited by 343 · see citing works
Forward Error Correction for DNA Data Storage
Blawat, M., Gaedke, K., Hütter, I., Chen, X.-M., Turczyk, B., Inverso, S., Pruitt, B. W., & Church, G. M. (2016) · Procedia Computer Science · doi:10.1016/j.procs.2016.05.398 · Cited by 333 · see citing works
DNA storage: research landscape and future prospects
Dong, Y., Sun, F., Ping, Z., Ouyang, Q., & Qian, L. (2020) · National Science Review · doi:10.1093/nsr/nwaa007 · Cited by 224 · see citing works
HEDGES error-correcting code for DNA storage corrects indels and allows sequence constraints
Press, W. H., Hawkins, J. A., Jones, S. K., Schaub, J. M., & Finkelstein, I. J. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2004821117 · Cited by 178 · see citing works
Antkowiak, P. L., Lietard, J., Darestani, M. Z., Somoza, M. M., Stark, W. J., Heckel, R., & Grass, R. N. (2020) · Nature Communications · doi:10.1038/s41467-020-19148-3 · Cited by 173 · see citing works
Reading and Writing Digital Data in DNA
Meiser, L. C., Antkowiak, P. L., Koch, J., Chen, W. D., Kohll, A. X., Stark, W. J., Heckel, R., & Grass, R. N. (2020) · Nature Protocols · doi:10.1038/s41596-019-0244-5 · Cited by 164 · see citing works
Kalign 3: multiple sequence alignment of large datasets
Lassmann, T. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz795 · Cited by 155 · see citing works
DNA assembly for nanopore data storage readout
Lopez, R., Chen, Y.-J., Dumas Ang, S., Yekhanin, S., Makarychev, K., Racz, M. Z., Seelig, G., Strauss, K., & Ceze, L. (2019) · Nature Communications · doi:10.1038/s41467-019-10978-4 · Cited by 142 · see citing works
MinION Analysis and Reference Consortium: Phase 2 data release and analysis of R9.0 chemistry
Jain, M., Tyson, J. R., Loose, M., Ip, C. L. C., Eccles, D. A., O'Grady, J., Malla, S., Leggett, R. M., Wallerman, O., Jansen, H. J., et al. (2017) · F1000Research · doi:10.12688/f1000research.11354.1 · Cited by 140 · see citing works
Demonstration of End-to-End Automation of DNA Data Storage.
Takahashi, C. N., Nguyen, B. H., Strauss, K., & Ceze, L. (2019) · Scientific Reports · doi:10.1038/s41598-019-41228-8 · Cited by 137 · see citing works
An Artificial Chromosome for Data Storage
Chen, W., Han, M., Zhou, J., Ge, Q., Wang, P., Zhang, X., Zhu, S., Song, L., & Yuan, Y. (2021) · National Science Review · doi:10.1093/nsr/nwab028 · Cited by 136 · see citing works
Synthetic DNA applications in information technology
Meiser, L. C., Nguyen, B. H., Chen, Y.-J., Nivala, J., Strauß, K., Ceze, L., & Grass, R. N. (2022) · Nature Communications · doi:10.1038/s41467-021-27846-9 · Cited by 129 · see citing works
Quantifying Molecular Bias in DNA Data Storage
Chen, Y.-J., Takahashi, C. N., Organick, L., Stewart, K., Ang, S. D., Weiss, P., Peck, B., Seelig, G., Ceze, L., & Strauss, K. (2019) · doi:10.1101/566554 · Cited by 109 · see citing works
Robust data storage in DNA by de Bruijn graph-based de novo strand assembly
Song, L., Geng, F., Gong, Z.-Y., Chen, X., Tang, J., Gong, C., Zhou, L., Xia, R., Han, M., Xu, J.-Y., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-33046-w · Cited by 98 · see citing works
Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage
Srinivasavaradhan, S. R., Gopi, S., Pfister, H. D., & Yekhanin, S. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517821 · Cited by 74 · see citing works
Tabatabaei, S. K., Pham, B., Pan, C., Liu, J., Chandak, S., Shorkey, S. A., Hernandez, A. G., Aksimentiev, A., Chen, M., Schroeder, C. M., et al. (2022) · Nano Letters · doi:10.1021/acs.nanolett.1c04203 · Cited by 63 · see citing works
Evaluating the Accuracy and Efficiency of Multiple Sequence Alignment Methods
Pervez, M. T., Babar, M. E., Nadeem, A., Aslam, M., Awan, A. R., Aslam, N., Hussain, T., Naveed, N., Qadri, S., Waheed, U., et al. (2014) · Evolutionary Bioinformatics · doi:10.4137/ebo.s19199 · Cited by 48 · see citing works
Optimized Code Design for Constrained DNA Data Storage With Asymmetric Errors
Li Juan, D. E. N. G., Wang, Y., Noor‐A‐Rahim, M., Guan, Y. L., Shi, Z., Gunawan, E., & Poh, C. L. (2019) · IEEE Access · doi:10.1109/access.2019.2924827 · Cited by 37 · see citing works
A robust and efficient DNA storage architecture based on modulation encoding and decoding
Zan, X., Xie, R., Yao, X., Xu, P., & Liu, W. (2022) · doi:10.1101/2022.05.25.490755 · Cited by 27 · see citing works
Self-citationSequencing barcode construction and identification methods based on block error-correction codes
Chen, W., Wang, L., Han, M., et al. (2020) · Science China Life Sciences · doi:10.1007/s11427-019-1651-3 · Cited by 22 · see citing works
DeSP: a systematic DNA storage error simulation pipeline
Yuan, L., Xie, Z., Wang, Y., & Wang, X. (2022) · BMC Bioinformatics · doi:10.1186/s12859-022-04723-w · Cited by 22 · see citing works
Error Rate-Based Log-Likelihood Ratio Processing for Low-Density Parity-Check Codes in DNA Storage
Lu, X., Jeong, J., Kim, J.-W., No, J., Park, H., No, A., & Kim, S. (2020) · IEEE Access · doi:10.1109/access.2020.3021700 · Cited by 16 · see citing works
A Characterization of the DNA Data Storage Channel
Heckel, R., Mikutis, G., & Grass, R. N. (2019) · Scientific Reports · doi:10.1038/s41598-019-45832-6 · Cited by 9 · see citing works
Flagged first, then by citations
Research works printed but not linked: 1
- Morrison DA. Multiple sequence alignment is not a solved problem. arXiv 2018.
Cited by
Sorted by citations
Buko, T., Tuczko, N., & Ishikawa, T. (2023) · BioTech · doi:10.3390/biotech12020044 · Cited by 21 · see citing works
“Recently, Xie et al. (2023) conducted an analysis showing the value of the sequencing depth for retrieving the right string of data [34].”
BackgroundMethodRebimbas, R., Glória, I., Chegão, J., Al-Rawi, M., Mousakhani Ganjeh, A., & Saraiva, J. A. (2026) · Journal of Biotechnology · doi:10.1016/j.jbiotec.2026.03.003
- Authors
- Xie, R., Zan, X., Chu, L., Su, Y., Xu, P., & Liu, W.
- Affiliations
- Guangzhou University (CN)
- Corresponding author
- Xu, Peng
- Liu, Wenbin
- Venue
- BMC Bioinformatics
- Published
- 2023-03-23
- Volume
- 24
- Issue
- 1
- Pages
- 111-111
- ISSN
- 1471-2105 (ISSN-L)
- PMC
- PMC10037887
- OpenAlex
- W4360611676
- Semantic Scholar
- 74f8858b95e309f94c3378a55d4b6ce092fdc8e0
- Cited by
- 32
- References
- 30
- Citations by year
- 2026: 9 · 2025: 7 · 2024: 12 · 2023: 4
- FWCI
- 2.85
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- BMC Bioinformatics (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- National Natural Science Foundation of China (62002079, 62072128)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
- Keywords
- DNA data storage, multiple sequence alignment, MAFFT, error correction, synchronization error, indels, sequencing depth, phase transitions, error recovery, error-correcting codes
- MeSH terms
- Algorithms, Computer Simulation, DNA, Sequence Alignment, Sequence Analysis, DNA
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-09.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-09.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review