Results 131 to 140 of about 24,879 (166)

Efficient trace reconstruction in DNA storage systems using bidirectional beam search. [PDF]

iScience
Gu Z, Xin H, Sharma P, Goh GY, Wong L, Nagarajan N.   +5 more
europepmc   +1 more source

Stability of Homomorphisms, Coverings and Cocycles I: Equivalence

Chapman M, Lubotzky A.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Phylogeny Numbers of Generalized Hamming Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chengyang Qian, Yaokun Wu, Yanzhen Xiong
openaire   +2 more sources

Graphs over Graded Rings and Relation with Hamming Graph

Bulletin of the Malaysian Mathematical Sciences Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shahram Mehry, Saadoun Mahmoudi
openaire   +2 more sources

Matchings in Lattice Graphs and Hamming Graphs

Combinatorics, Probability and Computing, 1994
In this paper we solve the following problem on the lattice graph L(m1,…,mn) and the Hamming graph H(m1,…,mn), generalizing a result of Felzenbaum-Holzman-Kleitman on the n-dimensional cube (all mi = 2): Characterize the vectors (s1.…,sn) such that there exists a maximum matching in L, respectively, H with exactly si edges in the ith direction.
Aigner, Martin, Klimmek, Regina
openaire   +2 more sources

Permutation Codes, Hamming Graphs and Turán Graphs

2019
This paper investigates the properties of permutation Hamming graphs, a class of graphs in which the vertices are the permutations of n symbols and the edges connect pairs of vertices at a Hamming distance greater than or equal to a value d. Despite a remarkable regularity, permutation Hamming graphs elude general formulas for relevant indicators like ...
Barta Janos, Montemanni Roberto
openaire   +1 more source

Hamming Matrix and Hamming Energy of a Graph

Match Communications in Mathematical and in Computer Chemistry
Hamming distance is a highly valuable quantity in computer science. In this work, we establish the Hamming matrix H of a graph G, H(G). This is a square matrix, where the elements of the H(G) are Hamming distances. Also, we define the Hamming energy of a graph, HE(G), which is a sum of the absolute eigenvalues of H(G).
Nemanja Vučićević, Izudin Redžepović, Nenad Stojanović   +2 more
openaire   +1 more source

Hamming Graphs and Permutation Codes

2017 Fourth International Conference on Mathematics and Computers in Sciences and in Industry (MCSI), 2017
A permutation code can be represented as a graph, in which the nodes correspond to the permutation codewords and the weights on the edges are the Hamming distances between the codewords. Graphs belonging to this class are called permutation Hamming graphs.
Barta Janos, Montemanni Roberto
openaire   +1 more source

Solitaire Clobber Played on Hamming Graphs

2008
The one-player game Solitaire Clobber was introduced by Demaine et al. Beaudou et al. considered a variation called SC2. Black and white stones are located on the vertices of a given graph. A move consists in picking a stone to replace an adjacent stone of the opposite color. The objective is to minimize the number of remaining stones.
Dorbec, Paul, Duchêne, Eric, Gravier, Sylvain   +2 more
openaire   +2 more sources