Efficient reconstruction of sequences
From MaRDI portal
Publication:4544450
Recommendations
Cited in
(46)- Vertex reconstruction in Cayley graphs
- Error graphs and the reconstruction of elements in groups
- Scanning multiple sequences via cache memory
- Reconstruction of objects from a minimum number of distorted patterns
- Optimal mean-based algorithms for trace reconstruction
- Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
- On t-revealing codes in binary Hamming spaces
- Information retrieval with unambiguous output
- Metric intersection problems in Cayley graphs and the Stirling recursion
- Reconstruction of permutations distorted by reversal errors
- On reconstruction of signed permutations distorted by reversal errors
- Efficient Reconstruction of RC-Equivalent Strings
- Reconstruction of a graph from 2–vicinities of its vertices
- Correcting dependent errors in sequences generated by finite-state processes
- Recoverable sequence transmission protocols
- scientific article; zbMATH DE number 1498818 (Why is no real title available?)
- A linear algorithm for string reconstruction in the reverse complement equivalence model
- Efficient Reconstruction Algorithms Using Shifted Lattices
- scientific article; zbMATH DE number 6900644 (Why is no real title available?)
- Efficient fully-compressed sequence representations
- Sequence Reconstruction for Limited-Magnitude Errors
- Parameter Estimation in Pair‐hidden Markov Models
- Efficient reconstruction of sequences from their subsequences of supersequences
- Tree trace reconstruction using subtraces
- Reconstruction of permutations distorted by single Kendall -errors
- Recoverable formal language
- Balanced reconstruction codes for single edits
- Reconstruction of hypermatrices from subhypermatrices
- The sequence reconstruction problem for permutations with the Hamming distance
- Sequence reconstruction problem for deletion channels: a complete asymptotic solution
- Improvements on permutation reconstruction from minors
- Trace reconstruction from local statistical queries
- Polynomial-time trace reconstruction in the smoothed complexity model
- Levenshtein's sequence reconstruction problem and results for larger alphabet sizes
- Minkowski \(\mathrm{t}\)-graph and Kendall \(\tau\)-graph of the symmetric group
- The sequence reconstruction of permutations with Hamming metric
- Global alignment of molecular sequences via ancestral state reconstruction
- Circular trace reconstruction
- Polynomial-time trace reconstruction in the low deletion rate regime
- Reconstructing graphs with subgraph compositions
- On the decoding error weight of one or two deletion channels
- Near-optimal trace reconstruction for mildly separated strings
- The sequence reconstruction of permutations under Hamming metric with small errors
- Sequence acquisition using bit estimation techniques
- Reconstruction of a graph from 2-vicinities of its vertices
- Some problems on Cayley graphs
This page was built for publication: Efficient reconstruction of sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544450)
