11 papers · ranked by Valyu relevance
Zachary Chase, Yuval Peres
In the trace reconstruction problem, the goal is to reconstruct an unknown string x of length n from multiple traces obtained by passing x through the deletion channel. In the relaxed problem of approximate trace reconstruction, the goal is to reconstruct an approximation xb of x which is close (within ǫn) to x in edit…
Kenta Takahashi, Wataru Nakamura
Lattices Authors: ['Kenta Takahashi' 'Wataru Nakamura'] Abstract—Fuzzy Extractor (FE) and Fuzzy Signature (FS) are useful schemes for generating cryptographic keys from fuzzy data such as biometric features. Several techniques have been proposed to implement FE and FS for fuzzy data in an Euclidean space, such as…
Piero Gasparotto, Luis Barba, Hans-Christian Stadler, Greta Assmann + 5 more
Serial Crystallography (SX) involves the processing of thousands of diffraction patterns coming from crystals in random orientations. To compile a complete dataset, these patterns must be indexed (i.e., determine orientation), integrated, and merged. We introduce the TORO (TOrch-powered Robust Optimization) Indexer, a…
Apurba Kumar Saha, Iftekhar Hakim Kaowsar, Mahdi Hasnat Siyam, M. Sohel Rahman
'M. Sohel Rahman'] Abstract. Two strings are considered to have parameterized matching when there exists a bijection of the parameterized alphabet onto itself such that it transforms one string to another. Parameterized matching has application in software duplication detection, image processing, and computational…
Junlin Wang, Zi Xu
Nonconvex-Strongly Concave Minimax Problems Authors: ['Junlin Wang' 'Zi Xu'] Abstract In this paper, we study second-order algorithms for solving nonconvexstrongly concave minimax problems, which have attracted much attention in recent years in many fields, especially in machine learning. We propose a gradient norm…
Chunchun Zhao, Sartaj Sahni
Background The Damerau-Levenshtein (DL) distance metric has been widely used in the biological science. It tries to identify the similar region of DNA,RNA and protein sequences by transforming one sequence to the another using the substitution, insertion, deletion and transposition operations. Lowrance and Wagner have…
Tamar Pinhas, Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson
We propose three algorithms for string edit distance with duplications and contractions. These include an efficient general algorithm and two improvements which apply under certain constraints on the cost function. The new algorithms solve a more general problem variant and obtain better time complexities with respect…
Arne Kutzner, Pok-Son Kim, Markus Schmidt
Seeding is usually the initial step of high-throughput sequence aligners. Two popular seeding strategies are fixed-size seeding (k-mers, minimizers) and variable-size seeding (MEMs, SMEMs, max. spanning seeds). The former strategy benefits from fast index building and fast seed computation, while the latter one…
Josiah Park, Carlos Saltijeral, Zhong Ming
—We provide a new numerical procedure for constructing low coherence matrices, Trust-Region Stochastic Tuning for Matrix Incoherence (TRSTMI) and detail the results of experiments with a CPU/GPU parallelized implementation of this method. These trials suggest the superiority of this approach over other existing methods…
Predrag Ivaniš, Srdjan Brkić, Bane Vasić, Syed A. Jafar
We propose a novel variant of the gradient descent bit-flipping (GDBF) algorithm for decoding low-density parity-check (LDPC) codes over the binary symmetric channel. The new bit-flipping rule is based on the reliability information passed from neighboring nodes in the corresponding Tanner graph. The name…
Ankur Moitra, Elchanan Mossel, Colin Sandon
In this work, we study the computational complexity of determining whether a given model that perfectly fits the training sample will generalize to unseen data. In particular, we study the power of a malicious agent whose goal is to construct a model f̂ that fits its training data and nothing else, but is…