Reconstruction of objects from a minimum number of distorted patterns

MaRDI QIDQ1595609zbMATH OpenFDO

Authors Vladimir Levenshtein

Publication date 13 February 2001

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

pattern recognitionmetric spacesdata transmission

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Efficient reconstruction of sequences
• scientific article; zbMATH DE number 1498818
• Problems of information on the set of words
• scientific article; zbMATH DE number 46004
• Reconstruction of permutations from their erroneous patterns

Cited in

(14)

• Vertex reconstruction in Cayley graphs
• Metric intersection problems in Cayley graphs and the Stirling recursion
• Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections.
• Efficient reconstruction of sequences from their subsequences of supersequences
• Efficient reconstruction of sequences
• Reconstruction of permutations distorted by reversal errors
• On reconstruction of signed permutations distorted by reversal errors
• Error graphs and the reconstruction of elements in groups
• Reconstruction of a graph from 2–vicinities of its vertices
• Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words
• Some problems on Cayley graphs
• Reconstruction of a graph from 2-vicinities of its vertices
• Information-Theoretic Foundations of DNA Data Storage
• The trace reconstruction problem for spider graphs

This page was built for publication: Reconstruction of objects from a minimum number of distorted patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1595609)