Alexandr Kovalev

Learn More
We suggest several techniques to improve the toric codes and the finite-rate generalized toric codes (quantum hypergraph-product codes) recently introduced by Tillich and Zémor. For the usual toric codes, we introduce the rotated lattices specified by two integer-valued periodicity vectors. These codes include the checkerboard codes, and the family(More)
We study the Simplified Partial Digest Problem (SPDP), which is a mathematical model for a new simplified partial digest method of genome mapping. This method is easy for laboratory implementation and robust with respect to the experimental errors. SPDP is NP-hard in the strong sense. We present an $O(n2^n)$ time enumerative algorithm and an $O(n^{2q})$(More)
Animals can move in not only elegant but also energy efficient ways. Their skin is one of the key components for this achievement. It provides a proper friction for forward motion and can protect them from slipping on a surface during locomotion. Inspired by this, we applied real shark skin to the foot soles of our hexapod robot AMOS. The material is formed(More)
The goal of the Simplified Partial Digest Problem (SPDP) is motivated by the reconstruction of the linear structure of a DNA chain with respect to a given nucleotide pattern, based on the multiset of distances between the adjacent patterns (interpoint distances) and the multiset of distances between each pattern and the two unlabeled endpoints of the DNA(More)
—We study the Simplified Partial Digest Problem (SPDP), which is a mathematical model for a new simplified partial digest method of genome mapping. This method is easy for laboratory implementation and robust with respect to the experimental errors. SPDP is NP-hard in the strong sense. We present an Oðn2 n Þ time enumerative algorithm (ENUM) and an Oðn 2q Þ(More)
  • 1