The Levenshtein's Sequence Reconstruction Problem and the Length of the List.
Ville JunnilaTero LaihonenTuomo LehtiläPublished in: IEEE Trans. Inf. Theory (2024)
Keyphrases
- edit distance
- edit operations
- fixed length
- three dimensional
- variable length
- longest common subsequence
- image reconstruction
- minimal length
- reconstruction error
- pseudorandom
- neural network
- finite alphabet
- compressed sensing
- shape recovery
- hidden markov models
- data sets
- compressive sensing
- reconstruction method
- sequence analysis
- discrete tomography
- reconstructed image
- computer vision