Efficient reconstruction of sequences

DOI10.1109/18.904499zbMath1029.94019OpenAlexW2170484108MaRDI QIDQ4544450

Vladimir I. Levenshtein

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bc842af110349422558cf4d4485801bbf782d4d3

zbMATH Keywords

algorithmssequencesgraphsdiscrete memoryless channelerror metriccombinatorial channelefficient reconstructionprobabilistic channelsrepeated transmission

Mathematics Subject Classification ID

Applications of graph theory (05C90) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Channel models (including quantum) in information and communication theory (94A40)

Related Items

Metric intersection problems in Cayley graphs and the Stirling recursion ⋮ Tree trace reconstruction using subtraces ⋮ Reconstruction of permutations distorted by single Kendall \(\tau\)-errors ⋮ A linear algorithm for string reconstruction in the reverse complement equivalence model ⋮ Efficient Reconstruction of RC-Equivalent Strings ⋮ Optimal mean-based algorithms for trace reconstruction ⋮ Reconstruction of permutations distorted by reversal errors ⋮ Reconstruction of a graph from 2-vicinities of its vertices ⋮ On reconstruction of signed permutations distorted by reversal errors ⋮ Some problems on Cayley graphs ⋮ Efficient reconstruction of sequences from their subsequences of supersequences ⋮ Parameter Estimation in Pair‐hidden Markov Models ⋮ Global alignment of molecular sequences via ancestral state reconstruction ⋮ On \(t\)-revealing codes in binary Hamming spaces ⋮ Subpolynomial trace reconstruction for random strings and arbitrary deletion probability ⋮ Vertex reconstruction in Cayley graphs ⋮ Error graphs and the reconstruction of elements in groups ⋮ Information retrieval with unambiguous output ⋮ Reconstruction of a graph from 2–vicinities of its vertices