Results 101 to 110 of about 3,822,513 (334)
Randomized Fast Design of Short DNA Words
, 2005 We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivations including DNA computing and DNA self-assembly.
Kao, Ming-Yang +2 more
core +2 more sources
FEBS Letters, EarlyView.Dimeric pyruvate formate‐lyase cleaves pyruvate using a radical‐based mechanism. G734 serves as a radical storage location, and the radical is transferred to the catalytic C419 residue. Mutation of the C418‐C419 pair causes loss of enzyme activity, but does not impede radical introduction onto G734. Therefore, cis‐ but not trans‐radical transfer occurs
Michelle Kammel +2 more
wiley +1 more source
Tight Bounds on the Simultaneous Estimation of Incompatible Parameters
Physical Review X, 2021 The estimation of multiple parameters in quantum metrology is important for a vast array of applications in quantum information processing. However, the unattainability of fundamental precision bounds for incompatible observables greatly diminishes the ...
Jasminder S. Sidhu +3 more
doaj +1 more source
A Practical Approach to Polar Codes [PDF]
arXiv, 2011 In this paper, we study polar codes from a practical point of view. In particular, we study concatenated polar codes and rate-compatible polar codes. First, we propose a concatenation scheme including polar codes and Low-Density Parity-Check (LDPC) codes.
arxiv
Molecular Oncology, EarlyView.Urine is a rich source of biomarkers for cancer detection. Tumor‐derived material is released into the bloodstream and transported to the urine. Urine can easily be collected from individuals, allowing non‐invasive cancer detection. This review discusses the rationale behind urine‐based cancer detection and its potential for cancer diagnostics ...
Birgit M. M. Wever +1 more
wiley +1 more source
Matlab Code for the Discrete Hankel Transform
Journal of Open Research Software, 2017 Previous definitions of a Discrete Hankel Transform (DHT) have focused on methods to approximate the continuous Hankel integral transform without regard for the properties of the DHT itself.
Natalie Baddour, Ugo Chouinard
doaj +1 more source
Galois LCD Codes over Finite Fields [PDF]
arXiv, 2017 In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and constacyclic codes to be Galois LCD codes are characterized.
arxiv
On Minimal Tree Realizations of Linear Codes
, 2007 A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization, i.e., a cycle-free realization of the code on the underlying tree, by ...
Kashyap, Navin
core +2 more sources
A comparative study of circulating tumor cell isolation and enumeration technologies in lung cancer
Molecular Oncology, EarlyView.Lung cancer cells were spiked into donor blood to evaluate the recovery rates of the following circulating tumor cell (CTC) enrichment technologies: CellMag™, EasySep™, RosetteSep™, Parsortix® PR1, and Parsortix® Prototype systems. Each method's advantages and disadvantages are described.
Volga M Saini +11 more
wiley +1 more source
KOALA GRAPH THEORY INTERNET SERVICE
TASK Quarterly, 2015 KOALA has been created with the idea of C++ library templates, implementing a broad set of procedures in the fields of algorithmic graph theory and network problems in discrete optimization.
TOMASZ GOLUCH +2 more
doaj +1 more source