12 papers
On the Vertices That Belong to All Minimum Identifying Codes
Ville Junnila, Tero Laihonen, Havu Miikonen
Identifying codes in graphs have been widely studied since their introduction by Karpovsky, Chakrabarty and Levitin in 1998. In this paper, we consider the vertices that are in eve…
On the Maximum Number of Vertices that Belong to Every Metric Basis
Anni Hakanen, Ville Junnila, Tero Laihonen +2
Metric bases of graphs have been widely studied since their introduction in the 1970's by Slater and, independently, by Harary and Melter. In this paper, we concentrate on the exis…
Unique Insertion Error Patterns in Levenshtein's Reconstruction Problem
Ville Junnila, Tero Laihonen, Tuomo Lehtilä +1
Levenshtein's sequence reconstruction model plays an essential role in information retrieval of advanced memory systems, such as the DNA-based storage systems. In the model, a word…
The Size of the Intersection of -ary Hamming Balls
Ville Junnila, Tero Laihonen, Tuomo Lehtilä +1
The interest in studying the size of the intersection of multiple -ary Hamming balls has grown due to the recent advances in DNA-based data storage systems. We present an exact…
New Results on Vertices that Belong to Every Minimum Locating-Dominating Code
Ville Junnila, Tero Laihonen, Havu Miikonen
Locating-dominating codes have been studied widely since their introduction in the 1980s by Slater and Rall. In this paper, we concentrate on vertices that must belong to all minim…
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…