DNA-seq error correction based on substring indices
From MaRDI portal
Recommendations
- Algorithms for next-generation sequencing data. Techniques, approaches, and applications
- Algorithms for indexing highly similar DNA sequences
- String-matching and alignment algorithms for finding motifs in NGS data
- Inferring a DNA sequence from erroneous copies
- An efficient approach to merging paired-end reads and incorporation of uncertainties
Cites work
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- A Space-Economical Suffix Tree Construction Algorithm
- An Eulerian path approach to DNA fragment assembly
- scientific article; zbMATH DE number 432779 (Why is no real title available?)
- Multiple filtration and approximate pattern matching
- On-line construction of suffix trees
- Replacing suffix trees with enhanced suffix arrays
Cited in
(8)- Error analysis of deep sequencing of phage libraries: peptides censored in sequencing
- New Error Tolerant Method for Search of Long Repeats in DNA Sequences
- Next-generation sequencing. Current technologies and applications
- PSAEC: an improved algorithm for short read error correction using partial suffix arrays
- Model-based quality assessment and base-calling for second-generation sequencing data
- Probabilistic models for error correction of nonuniform sequencing data
- An efficient approach to merging paired-end reads and incorporation of uncertainties
- Sequence-Subset Distance and Coding for Error Control in DNA-Based Data Storage
This page was built for publication: DNA-seq error correction based on substring indices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305526)
