Alexandr Kovalev

Learn 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)
Insects, like dung beetles, show fascinating locomotor abilities. They can use their legs to walk on complex terrains (e.g., rocky and curved surfaces) and to manipulate objects. They also exploit their compliant tarsi, increasing the contact area between the legs and surface, to enhance locomotion, and object manipulation efficiency. Besides these(More)
  • A. Kovalev, N. Zarrabi, F. Werz, M. Boersch, Z. Ristic, H. Lill +3 others
  • 2009
The conformational kinetics of enzymes can be reliably revealed when they are governed by Markovian dynamics. Hidden Markov Models (HMMs) are appropriate especially in the case of conformational states that are hardly distinguishable. However, the evolution of the conformational states of proteins mostly shows non-Markovian behavior, recognizable by(More)
  • 1