#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2003

2013

- This year (0)
- Last 5 years (2)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alexey V. Agafonov, Elena N. Gritsenko, +4 authors Galina D. Mironova
- Biochimica et biophysica acta
- 2003

Formation of palmitic acid/Ca(2+) (PA/Ca(2+)) complexes was suggested to play a key role in the non-classical permeability transition in mitochondria (NCPT), which seems to be involved in the PA-induced apoptosis of cardiomyocytes. Our previous studies of complexation of free fatty acids (FFA) with Ca(2+) showed that long-chain (C:16-C:22) saturated FFA had… (More)

- Alexandr Kovalev, C. T. Ng
- European Journal of Operational Research
- 2008

The Economic Order Quantity problem is a fundamental problem of inventory management. An optimal solution to this problem in a closed form exists under the assumption that time and the product are continuously divisible and demand occurs at a constant rate k. We prove that a discrete version of this problem, in which time and the product are discrete is… (More)

- Alexandr Kovalev, Leonid P. Pryadko
- 2012 IEEE International Symposium on Information…
- 2012

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)

- Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Y. Kovalyov
- IEEE/ACM Transactions on Computational Biology…
- 2007

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)

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Þ time enumerative algorithm (ENUM) and an OðnÞ time… (More)

- Poramate Manoonpong, Dennis Goldschmidt, Florentin Wörgötter, Alexandr Kovalev, Lars Heepe, Stanislav N. Gorb
- Living Machines
- 2013

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)

- I. V. Vel'bitsky, Alexandr Kovalev, I. V. Kasatkina, Lei Wang
- Journal of Computer Science and Technology
- 2008

This paper presents a kind of visual programming, which is called R-technology of programming. The R-technology is independent of any programming language or operating system and the R-chart is in accord with international standard (ISO 8631H). The package of R-technology has been applied to the high level languages such as PASCAL, C, ASSEMBLER, FORTRAN,… (More)

- Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Y. Kovalyov
- European Journal of Operational Research
- 2011

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)

- Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Y. Kovalyov
- Discrete Applied Mathematics
- 2009

In this paper, we analyse the computational complexity of an optimization version of the Simplified Partial Digest Problem (SPDP), which is amathematical model for DNAmapping based on the results of a simplified partial digest experiment. We prove that recognizing 46.16% of the elements of the DNA map in the error-free simplified partial digest experiment… (More)

- ‹
- 1
- ›