Related papers: Challenges in structural variant calling in low-co…
We consider learning the structures of Gaussian latent tree models with vector observations when a subset of them are arbitrarily corrupted. First, we present the sample complexities of Recursive Grouping (RG) and Chow-Liu Recursive…
Locally Decodable Codes (LDCs) are error-correcting codes $C:\Sigma^n\rightarrow \Sigma^m$ with super-fast decoding algorithms. They are important mathematical objects in many areas of theoretical computer science, yet the best…
A small sample of 7 southern Compact Steep Spectrum (CSS) radio sources has been selected as part of the study of a larger flux-limited complete sample of radio sources. High resolution images, using the VLBI network in the southern…
Finding an Approximate Longest Common Substring (ALCS) within a given set $S=\{s_1,s_2,\ldots,s_m\}$ of $m \ge 2$ strings is a key problem in computational biology, such as identifying related mutations across multiple genetic sequences. We…
Given a random RNA secondary structure, $S$, we study RNA sequences having fixed ratios of nuclotides that are compatible with $S$. We perform this analysis for RNA secondary structures subject to various base pairing rules and minimum arc-…
Large language models write production code, and yet they routinely introduce well-known vulnerabilities. We show that this is not a knowledge deficit: the same models that generate insecure code, correctly identify and explain the…
In this work, we investigate a challenging problem, which has been considered to be an important criterion in designing codewords for DNA computing purposes, namely secondary structure avoidance in single-stranded DNA molecules. In short,…
We analyze 99 photometrically selected Little Red Dots (LRDs) at $z \approx 4-8$ in the GOODS fields, leveraging ultra-deep JADES NIRCam short-wavelength (SW) data. We examine the morphology of 30 LRDs, while the remaining 69 appear…
Background: Several sources of noise obfuscate the identification of single nucleotide variation (SNV) in next generation sequencing data. For instance, errors may be introduced during library construction and sequencing steps. In addition,…
Locally decodable codes (LDCs) are error-correcting codes $C : \Sigma^k \to \Sigma^n$ that admit a local decoding algorithm that recovers each individual bit of the message by querying only a few bits from a noisy codeword. An important…
We report on the results of a long time photometric monitoring of the two metal poor Galactic globular clusters M22 and IC4499 searching for long period variables (LPVs) on the upper giant branch. We detected 22 new LPVs in the field of M22…
In magnetic-recording systems, consecutive sections experience different signal to noise ratios (SNRs). To perform error correction over these systems, one approach is to use an individual block code for each section. However, the…
LLM-based vulnerability detectors are increasingly deployed in CI/CD security gating, yet their resilience to evasion under syntax- and compilation-preserving edits remains poorly understood. We evaluate five attack variants spanning four…
We report the results of multifrequency-VLBI observations of GHz-Peaked-Spectrum (GPS) radio sources. The VLBI structure and component spectra of some GPS sources are presented. Our VLBI results show that about 80% of the GPS galaxies…
Motivation: Detection of structural variants (SV) from the alignment of sample DNA reads to the reference genome is an important problem in understanding human diseases. Long reads that can span repeat regions, along with an accurate…
The tremdendous advances in high-throughput sequencing technologies have made population-scale sequencing as performed in the 1000 Genomes project and the Genome of the Netherlands project possible. Next-generation sequencing has allowed…
The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be…
In a DNA sequence, we have the celebrated Watson-Crick complement $\overline{T}=A$, $\overline{A}=T$, $\overline{C}=G$, and $\overline{G}=C$. Given an integer $m\ge 2$, a secondary structure in a DNA sequence refers to the existence of two…
The human T cell repertoire is generated by the rearrangement of variable (V), diversity (D) and joining (J) segments on the T cell receptor (TCR) loci. To determine whether the structural ordering of these gene segments on the TCR loci…
The XMM Large Scale Structure Survey (XMM-LSS) is a major project to map the large scale structure of the universe out to cosmological distances. An 8 degree by 8 degree region will be surveyed by XMM with planned optical follow-up to…