Vyacheslav V. Rykov

Learn More
Let [t] represent a nite population with t elements. Suppose we have an unknown d-family of k-subsets of [t]. We refer to as the set of positive k-complexes. In the group testing for complexes problem, must be identi ed by performing 0, 1 tests on subsets or pools of [t]. A pool is said to be positive if it completely contains a complex; otherwise the pool(More)
We describe how deletion-correcting codes may be enhanced to yield codes with double-strand DNAsequence codewords. This enhancement involves abstractions of the pertinent aspects of DNA; it nevertheless ensures specificity of binding for all pairs of single strands derived from its codewords—the key desideratum of DNA codes– i.e. with binding feasible only(More)
DNA nanotechnology often requires collections of oligonucleotides called "DNA free energy gap codes" that do not produce erroneous crosshybridizations in a competitive muliplexing environment. This paper addresses the question of how to design these codes to accomplish a desired amount of work within an acceptable error rate. Using a statistical(More)
We discuss the concept of t-gap block isomorphic subsequences and use it to describe new abstract string metrics that are similar to the Levenshtein insertion-deletion metric. Some of the metrics that we define can be used to model a thermodynamic distance function on single-stranded DNA sequences. Our model captures a key aspect of the nearest neighbor(More)
s of Reports to Sixth All-Union Seminar-Workshop on Computer Networks [in Russian], Part 4, MoscowVinnitsa (1981), pp. 18-24. 4. R. G. Gallager, Information Theory and Reliable Communication, Wiley (1968). CYCLICITY OF EXTENDED GOPPA CODES A. L. Vishnevetskii UDC 621.391.15 The author obtains a cyclicity criterion for extended Goppa code r(L, g), for some(More)
We consider DNA codes based on the concept of a weighted 2-stem similarity measure which reflects the ldquohybridization potentialrdquo of two DNA sequences. A random coding bound on the rate of DNA codes with respect to a thermodynamic motivated similarity measure is proved. Ensembles of DNA strands whose sequence composition is restricted in a manner(More)
We present a group testing approach to identify the first d vertices with the highest betweenness centrality. Betweenness centrality (BC) of a vertex is the ratio of shortest paths that pass through it and is an important metric in complex networks. The Brandes algorithm computes the BC cumulatively over all vertices. Approximate BC of a single vertex can(More)