Linear Constructions for Hamming Distance of DNA Codes

2007 ◽  
Vol 4 (7) ◽  
pp. 1231-1236
Author(s):  
Xiangou Zhu ◽  
Wenbing Liu ◽  
Chuan Sun ◽  
Wenguo Wu
Keyword(s):  
Hamming Distance ◽  
Dna Codes

scholarly journals Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content

2011 ◽  
Vol 311 (13) ◽  
pp. 1207-1219 ◽  
Author(s):  
Derek H. Smith ◽  
Niema Aboluion ◽  
Roberto Montemanni ◽  
Stephanie Perkins
Keyword(s):  
Hamming Distance ◽  
Dna Codes ◽  
Linear And Nonlinear

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 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.

CLASS OF BOOLEAN FUNCTIONS CONSTRUCTED USING SIGNIFICANT BITS OF LINEAR RECURRENCES OVER THE RING ℤ2n

2019 ◽  
Vol 6 (2) ◽  
pp. 90-94
Author(s):  
Hernandez Piloto Daniel Humberto
Keyword(s):  
Linear Function ◽  
Boolean Functions ◽  
Hamming Distance ◽  
Linear Recurrences ◽  
Maximum Period ◽  
Non Linear ◽  
The Given ◽  
Class Of Functions

In this work a class of functions is studied, which are built with the help of significant bits sequences on the ring ℤ2n. This class is built with use of a function ψ: ℤ2n → ℤ2. In public literature there are works in which ψ is a linear function. Here we will use a non-linear ψ function for this set. It is known that the period of a polynomial F in the ring ℤ2n is equal to T(mod 2)2α, where α∈ , n01- . The polynomials for which it is true that T(F) = T(F mod 2), in other words α = 0, are called marked polynomials. For our class we are going to use a polynomial with a maximum period as the characteristic polyomial. In the present work we show the bounds of the given class: non-linearity, the weight of the functions, the Hamming distance between functions. The Hamming distance between these functions and functions of other known classes is also given.

SISTEM PENGENALAN MANUSIA MELALUI KEUNIKAN FISIOLOGIS SELAPUT PELANGI MATA DENGAN MENGGUNAKAN FILTER LOG GABOR

KONVERGENSI ◽  
2019 ◽  
Vol 13 (1) ◽  
Author(s):  
Bima Agung Pratama ◽  
Fajar Astuti Hermawati
Keyword(s):  
Iris Recognition ◽  
Hamming Distance ◽  
Rubber Sheet ◽  
Log Gabor

Penelitian ini mengajukan sebuah sistem pengenalan manusia melalui karakteristik pola fisiologis selaput pelangi (iris) matanya. Pengenalan selaput pelangi mata (iris recognition) merupakan suatu teknologi pengolahan citra yang digunakan untuk mendeteksi dan menampilkan selaput pelangi (iris) pada alat indera mata manusia saat kelopak mata terbuka. Terdapat beberapa tahap dalam proses pengenalan menggunakan pola iris mata manusia. Langkah pertama adalah melakukan proses segmentasi untuk mendapatkan daerah selaput pelangi (iris) mata yang berbentuk melingkat dengan menggunakan metode operator integro-diferensial. Selanjutnya dilakukan proses normalisasi hasil segmentasi menjadi bentuk polar dengan menerapkan metode metode Daughman’s rubber sheet model. Setelah itu diterapkan proses ekstraksi fitur atau pola dari citra ternormalisasi menggunakan filter Log-Gabor. Pencocokan untuk mengukur kesamaan antara pola iris mata manusia dengan pola-pola dalam basisdata sistem dilakukan menggunakan Hamming distance. Dalam percobaan pengenalan individu menggunakan basisdata iris mata MMU diperoleh akurasi sebesar 98%. Kata Kunci: Pengenalan selaput pelangi, Pengenalan iris mata, Filter log-Gabor, Segmentasi citra, Sistem biometrik

Implementasi Algoritma Hamming Distance dan Brute Force dalam Mendeteksi Kemiripan Source Code Bahasa Pemrograman C

2017 ◽  
Vol 8 (2) ◽  
Author(s):  
Andreas Budiman ◽  
Dennis Gunawan ◽  
Seng Hansun
Keyword(s):  
College Presidents ◽  
Hamming Distance ◽  
Source Code ◽  
Structural Type ◽  
Brute Force ◽  
Important Thing ◽  
The Past ◽  
Index Terms ◽  
Better Than

Plagiarism is a behavior that causes violence of copyrights. Survey shows 55% of college presidents say that plagiarism in students’ papers has increased over the past 10 years. Therefore, an application for detecting plagiarism is needed, especially for teachers. This plagiarism checker application is made by using Visual C# 2010. The plagiarism checker uses hamming distance algorithm for matching line code of the source code. This algorithm works by matching the same length string of the code programs. Thus, it needs brute will be matched with hamming distance. Another important thing for detecting plagiarism is the preprocessing, which is used to help the algorithm for detecting plagiarized source code. This paper shows that the application works good in detecting plagiarism, the hamming distance algorithm and brute force algorithm works better than levenstein distance algorithm for detecting structural type of plagiarism and this thesis also shows that the preprocessing could help the application to increase its percentage and its accuracy. Index Terms—Brute Force, Hamming Distance, Plagiarisme, Preprocessing.

Algoritma Fisher-Yates Shuffle dan Flood Fill sebagai Maze Generator pada Game Labirin

2019 ◽  
Vol 10 (2) ◽  
pp. 59-64
Author(s):  
D.J. Owen Hoetama ◽  
Farica Perdana Putri ◽  
P.M. Winarno
Keyword(s):  
Hamming Distance ◽  
Problem Solution ◽  
Average Percentage ◽  
Rate Difference ◽  
Level Problem ◽  
Index Terms ◽  
Flood Fill ◽  
Static Level ◽  
Wall Position

Maze game is an interesting game and used to spend time. However, in the maze game, the level used forthis game still uses static levels. Static levels make the maze shape stay the same if we play the same level. Thus, players will quickly feel bored because it finds the same complexity. Maze generator is a static level problem solution on the maze game. This research uses Fisher-Yates Shuffle algorithm and Flood Fill algorithm to make maze generator. Fisher-Yates Shuffle algorithm is used for wall position randomization and Flood Fill algorithm to keep the maze results to remain resolved. The results of the application implementation yielded 30 mazes and were tested using the Hamming Distance algorithm, yielding that the result of the maze formed is always different. The average percentage rate difference produced 48% each time the maze was formed. The results of the maze that was formed performed perfect maze checking with the result of 83.33% percentage. Index Terms— Fisher-Yates Shuffle, Flood Fill, MazeGenerator, Hamming Distance

An Information-theoretical Model for Breast Cancer Detection

2008 ◽  
Vol 47 (04) ◽  
pp. 322-327 ◽  
Author(s):  
D. Blokh ◽  
N. Zurgil ◽  
I. Stambler ◽  
E. Afrimzon ◽  
Y. Shafran ◽  
...  
Keyword(s):  
Breast Cancer ◽  
Cancer Detection ◽  
Hamming Distance ◽  
Formal Model ◽  
Methodological Approach ◽  
Breast Cancer Detection ◽  
Receptor Expression ◽  
Diagnostic Model ◽  
Model Parameters ◽  
Two Stages

Summary Objectives: Formal diagnostic modeling is an important line of modern biological and medical research. The construction of a formal diagnostic model consists of two stages: first, the estimation of correlation between model parameters and the disease under consideration; and second, the construction of a diagnostic decision rule using these correlation estimates. A serious drawback of current diagnostic models is the absence of a unified mathematical methodological approach to implementing these two stages. The absence of aunified approach makesthe theoretical/biomedical substantiation of diagnostic rules difficult and reduces the efficacyofactual diagnostic model application. Methods: The present study constructs a formal model for breast cancer detection. The diagnostic model is based on information theory. Normalized mutual information is chosen as the measure of relevance between parameters and the patterns studied. The “nearest neighbor” rule is utilized for diagnosis, while the distance between elements is the weighted Hamming distance. The model concomitantly employs cellular fluorescence polarization as the quantitative input parameter and cell receptor expression as qualitative parameters. Results: Twenty-four healthy individuals and 34 patients (not including the subjects analyzed for the model construction) were tested by the model. Twenty-three healthy subjects and 34 patients were correctly diagnosed. Conclusions: The proposed diagnostic model is an open one,i.e.it can accommodate new additional parameters, which may increase its effectiveness.

Sign in / Sign up

Export Citation Format

Share Document