scholarly journals Bounds for DNA Codes with Constant GC-Content

10.37236/1726 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Oliver D. King
Keyword(s):  
Lower Bounds ◽  
Hamming Distance ◽  
Gc Content ◽  
Maximum Size ◽  
Additional Constraint ◽  
Upper And Lower Bounds ◽  
Dna Codes ◽  
Minimum Hamming Distance ◽  
Reverse Complement

We derive theoretical upper and lower bounds on the maximum size of DNA codes of length $n$ with constant GC-content $w$ and minimum Hamming distance $d$, both with and without the additional constraint that the minimum Hamming distance between any codeword and the reverse-complement of any codeword be at least $d$. We also explicitly construct codes that are larger than the best previously-published codes for many choices of the parameters $n$, $d$ and $w$.

scholarly journals New Bounds on the Minimum Average Distance of Binary Codes

2010 ◽  
Vol 2 (3) ◽  
pp. 489
Author(s):  
M. Basu ◽  
S. Bagchi
Keyword(s):  
Lower Bounds ◽  
Binary Code ◽  
Hamming Distance ◽  
Average Distance ◽  
Upper And Lower Bounds ◽  
Binary Codes ◽  
Large N

The minimum average Hamming distance of binary codes of length n and cardinality M is denoted by b(n,M). All the known lower bounds b(n,M) are useful when M is at least of size about 2n-1/n . In this paper, for large n, we improve upper and lower bounds for b(n,M). Keywords: Binary code; Hamming distance; Minimum average Hamming distance. © 2010 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v2i3.2708                  J. Sci. Res. 2 (3), 489-493 (2010) 

scholarly journals Improved Lower Bounds for Constant GC-Content DNA Codes

2008 ◽  
Vol 54 (1) ◽  
pp. 391-394 ◽  
Author(s):  
Yeow Meng Chee ◽  
San Ling
Keyword(s):  
Lower Bounds ◽  
Gc Content ◽  
Dna Codes

scholarly journals Construction of Dual Cyclic Codes over {F}_{2}[u,v]/ for DNA Computation

2018 ◽  
Vol 68 (5) ◽  
pp. 467-472
Author(s):  
Manoj Kumar Singh ◽  
Abhay Kumar Singh ◽  
Narendra Kumar ◽  
Pooja Mishra ◽  
Indivar Gupta
Keyword(s):  
Cyclic Codes ◽  
Gc Content ◽  
Inner Product ◽  
Dual Codes ◽  
Dna Computation ◽  
Dna Codes ◽  
Reverse Complement

Here, we assume the construction of cyclic codes over ℜ={F}_{2}[u,v]/ < u^2, v^2 - v, uv - vu >. In particular, dual cyclic codes over ℜ= {F}_{2}[u]/ <u^2> with respect to Euclidean inner product are discussed. The cyclic dual codes over ℜ are studied with respect to DNA codes (reverse and reverse complement). Many interesting results are obtained. Some examples are also provided, which explain the main results. The GC-Content and DNA codes over ℜ are discussed. We summarise the article by giving a special DNA table.

scholarly journals The DNA Word Design Problem: A New Constraint Model and New Results

2017 ◽  
Author(s):  
Michael Codish ◽  
Michael Frank ◽  
Vitaly Lagoon
Keyword(s):  
Lower Bounds ◽  
Design Problem ◽  
Coding Theory ◽  
Hamming Distance ◽  
Fundamental Problem ◽  
Boolean Satisfiability ◽  
Maximum Cardinality ◽  
Dna Codes ◽  
Constraint Model ◽  
Additional Constraints

A fundamental problem in coding theory concerns the computation of the maximum cardinality of a set S of length n code words over an alphabet of size q, such that every pair of code words has Hamming distance at least d, and the set of additional constraints U on S is satisfied. This problem has application in several areas, one of which is the design of DNA codes where q=4 and the alphabet is {A,C,G,T}. We describe a new constraint model for this problem and demonstrate that it improves on previous solutions (computes better lower bounds) for various instances of the problem. Our approach is based on a clustering of DNA words into small sets of words. Solutions are then obtained as the union of such clusters. Our approach is SAT based: we specify constraints on clusters of DNA words and solve these using a Boolean satisfiability solver.

scholarly journals On the Generalized Distance Energy of Graphs

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Connected Graph ◽  
Distance Matrix ◽  
Wiener Index ◽  
Diagonal Matrix ◽  
Upper And Lower Bounds ◽  
Star Graph ◽  
Extremal Graphs ◽  
Generalized Distance

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.

scholarly journals Hadamard k-fractional inequalities of Fejér type for GA-s-convex mappings and applications

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Hui Lei ◽  
Gou Hu ◽  
Zhi-Jie Cao ◽  
Ting-Song Du
Keyword(s):  
Lower Bounds ◽  
Hypergeometric Functions ◽  
Upper And Lower Bounds ◽  
Weighted Inequalities ◽  
Convex Mappings ◽  
Special Means

Abstract The main aim of this paper is to establish some Fejér-type inequalities involving hypergeometric functions in terms of GA-s-convexity. For this purpose, we construct a Hadamard k-fractional identity related to geometrically symmetric mappings. Moreover, we give the upper and lower bounds for the weighted inequalities via products of two different mappings. Some applications of the presented results to special means are also provided.

Sign in / Sign up

Export Citation Format

Share Document