Results 71 to 80 of about 1,167,245 (202)
Accel-Align: a fast sequence mapper and aligner based on the seed–embed–extend method
BMC Bioinformatics, 2021 Background Improvements in sequencing technology continue to drive sequencing cost towards $100 per genome. However, mapping sequenced data to a reference genome remains a computationally-intensive task due to the dependence on edit distance for dealing ...
Yiqing Yan +2 more
doaj +1 more source
Classifying Quranic Verse Topics using Word Centrality Measure
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi), 2021 Muslims believe that, as the speech of Allah, The Quran is a miracle that has specialties in itself. Some of the specialties that have studied are the regularities in the number of letters, words, vocabularies, etc.
Ferdian Yulianto +2 more
doaj +1 more source
Retracts of Infinite Hamming Graphs
Journal of Combinatorial Theory, Series B, 1997 A Hamming graph is a Cartesian product of complete graphs. We show that (finite or infinite) quasi-median graphs, which are a generalization of median graphs, are exactly the retracts of Hamming graphs. This generalizes a result of \textit{H. J. Bandelt} [J.
openaire +2 more sources
Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance
Journal of Applied Mathematics, 2013 In a shortest path improvement problem under unit Hamming distance (denoted by SPIUH), an edge weighted graph with a set of source-terminal pairs is given; we need to modify the lengths of edges by a minimum cost under unit Hamming distance such that the
Bingwu Zhang +3 more
doaj +1 more source
Journal of Integrative Bioinformatics, 2004 We propose a method for visualizing a set of related metabolic pathways across organisms using 2 1/2 dimensional graph visualization. Interdependent, twodimensional layouts of each pathway are stacked on top of each other so that biologists get a full ...
Brandes Ulrik, Dwyer Tim, Schreiber Falk
doaj +1 more source
Top Position Sensitive Ordinal Relation Preserving Bitwise Weight for Image Retrieval
Algorithms, 2020 In recent years, binary coding methods have become increasingly popular for tasks of searching approximate nearest neighbors (ANNs). High-dimensional data can be quantized into binary codes to give an efficient similarity approximation via a Hamming ...
Zhen Wang +4 more
doaj +1 more source
On Robust Colorings of Hamming-Distance Graphs [PDF]
The Electronic Journal of Combinatorics, 2018 $H_q(n,d)$ is defined as the graph with vertex set $\mathbb{Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$. For the $4$-colorings of the graphs $H_2(n,n-1)$ a notion of robustness is introduced. It is based on the tolerance
Harney, Isaiah, Gluesing-Luerssen, Heide
openaire +3 more sources
Randomized Communication and Implicit Graph Representations [PDF]
TheoretiCSWe initiate the focused study of constant-cost randomized communication, with emphasis on its connection to graph representations. We observe that constant-cost randomized communication problems are equivalent to hereditary (i.e.
Nathaniel Harms +2 more
doaj +1 more source
On the Automatic Analysis of the Practical Resistance of Obfusting Transformations
Моделирование и анализ информационных систем, 2019 A method is developed for assessing the practical persistence of obfuscating transformations of programs based on the calculation of the similarity index for the original, obfuscated and deobfuscated programs.
Petr D. Borisov, Yu. V. Kosolapov
doaj +1 more source
The Graph, Geometry and Symmetries of the Genetic Code with Hamming Metric
Symmetry, 2015 The similarity patterns of the genetic code result from similar codons encoding similar messages. We develop a new mathematical model to analyze these patterns. The physicochemical characteristics of amino acids objectively quantify their differences and
R. Lenstra
semanticscholar +1 more source