1 citations · 1 across the 4 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.IT2025
Levenshtein's Sequence Reconstruction Problem and Results for Larger Alphabet Sizes
Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The problem of storing large amounts of information safely for a long period of time has become essential. One of the most promising new data storage mediums are the polymer-based…
math.CO2025
The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms
Gerold Jäger, Tuomo Lehtilä
We consider a logical puzzle which we call double pouring problem, which was original defined for vessels. We generalize this definition to as follows. Each of the…
math.CO2025
Reconstructing graphs with subgraph compositions
Antoine Dailly, Tuomo Lehtilä
We generalize the problem of reconstructing strings from their substring compositions first introduced by Acharya et al. in 2015 motivated by polymer-based advanced data storage sy…