Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

2457 · Dec 201919922001200920172026
48 results for forensic DNA

An evolutionary algorithm separates mixed DNA profiles in forensic genetics.

problem Deconvolving mixed DNA profiles from crime samples.
method Multiple population evolutionary algorithm (MEA) with guided mutation.
result The MEA successfully deconvoluted DNA profiles from crime samples.

This research adapts superpixels for Shapley value computation in DNA profile classification.

problem Efficiently computing Shapley values for large, multidimensional time-series data.
method Adapting the concept of superpixels to streamline Shapley value computation for time-series-like data.
result Realistic, accurate, and fast computation of Shapley values for DNA profile classification.

An important problem in forensic analyses is identifying the provenance of materials at a crime scene, such as biological material on a piece of clothing. This procedure, known as geolocation, is conventionally guided by expert knowledge of the biological evidence and therefore tends to be application-specific, labor-i…

2019-05-28abs ↗pdf ↗

Recently the GAN generated face images are more and more realistic with high-quality, even hard for human eyes to detect. On the other hand, the forensics community keeps on developing methods to detect these generated fake images and try to guarantee the credibility of visual contents. Although researchers have develo…

2019-02-27abs ↗pdf ↗

Bayesian neural networks improve reliability in multimedia forensics.

problem Challenges with out-of-distribution data in multimedia authentication.
method Proposes Bayesian neural networks (BNN) for forensic tasks.
result BNNs provide distributions for better reliability and out-of-distribution detection.

Recently, image forensics community has paied attention to the research on the design of effective algorithms based on deep learning technology and facts proved that combining the domain knowledge of image forensics and deep learning would achieve more robust and better performance than the traditional schemes. Instead…

2018-03-29abs ↗pdf ↗

We introduce a Bayesian solution for the problem in forensic speaker recognition, where there may be very little background material for estimating score calibration parameters. We work within the Bayesian paradigm of evidence reporting and develop a principled probabilistic treatment of the problem, which results in a…

2014-03-24abs ↗pdf ↗

Many researches demonstrated that the DNA methylation, which occurs in the context of a CpG, has strong correlation with diseases, including cancer. There is a strong interest in analyzing the DNA methylation data to find how to distinguish different subtypes of the tumor. However, the conventional statistical methods …

2018-08-02abs ↗pdf ↗

New model helps identify suspect footwear from crime scene prints.

problem Identifying a suspect's footwear from crime scene prints among thousands of similar shoes.
method Developed a hierarchical Bayesian model with spatially varying coefficients.
result Improved accuracy and reliability in forensic shoe print analysis.

We propose generative neural network methods to generate DNA sequences and tune them to have desired properties. We present three approaches: creating synthetic DNA sequences using a generative adversarial network; a DNA-based variant of the activation maximization ("deep dream") design method; and a joint procedure wh…

2017-12-17abs ↗pdf ↗

The protein recombinase can change the knot type of circular DNA. The action of a recombinase converting one knot into another knot is normally mathematically modeled by band surgery. Band surgeries on a 2-bridge knot N((4mn-1)/(2m)) yielding a (2,2k)-torus link are characterized. We apply this and other rational tangl…

2011-08-03abs ↗pdf ↗

DNAS disentangles neural architecture search for better interpretability and performance.

problem Lack of interpretability in existing neural architecture search methods.
method DNAS disentangles the hidden representation of the controller into semantically meaningful concepts.
result DNAS achieves state-of-the-art performance and competitive architectures.

This paper is an introduction to rational tangles, rational knots and links and their applications to DNA. The paper can be read as an introduction to our more technical papers on rational tangles (math.GT/0311499) and on rational knots (math.GT/0212011). The present paper includes a self-contained account of the tangl…

2003-11-27abs ↗pdf ↗

We study two systems of tangle equations that arise when modeling the action of the Integrase family of proteins on DNA. These two systems--direct and inverted repeats--correspond to two different possibilities for the initial DNA sequence. We present one new class of solutions to the tangle equations. In the case of i…

2004-12-23abs ↗pdf ↗

A faster method for optimizing DNA and protein sequences using machine learning.

problem Designing DNA and protein sequences with improved function.
method Activation maximization with a straight-through approximation and adaptive entropy variable.
result Fast SeqProp achieves up to 100-fold faster convergence and improved fitness optima.

A deep probabilistic model analyzes DNA-encoded library data for efficient screening.

problem Complex data from DNA-encoded library experiments mask underlying signals.
method Compositional deep probabilistic model of DEL data, modeling latent reactions between synthons.
result DEL-Compose model demonstrates strong performance and valuable insights.

In this paper we propose network methodology to infer prognostic cancer biomarkers based on the epigenetic pattern DNA methylation. Epigenetic processes such as DNA methylation reflect environmental risk factors, and are increasingly recognised for their fundamental role in diseases such as cancer. DNA methylation is a…

2015-06-17abs ↗pdf ↗

When analyzing the genome, researchers have discovered that proteins bind to DNA based on certain patterns of the DNA sequence known as "motifs". However, it is difficult to manually construct motifs due to their complexity. Recently, externally learned memory models have proven to be effective methods for reasoning ov…

2017-02-22abs ↗pdf ↗

Paper uses transfer learning and Bayesian optimization to reduce DNA sequence design experiments.

problem Designing many similar DNA sequences for specific applications is expensive and time-consuming.
method Combines transfer learning with Bayesian optimization to reduce experiment count.
result Total number of experiments can be significantly reduced by sharing information between tasks.

We consider the task of detecting regulatory elements in the human genome directly from raw DNA. Past work has focused on small snippets of DNA, making it difficult to model long-distance dependencies that arise from DNA's 3-dimensional conformation. In order to study long-distance dependencies, we develop and release …

2017-10-03abs ↗pdf ↗

We consider learning parameters of Binomial Hidden Markov Models, which may be used to model DNA methylation data. The standard algorithm for the problem is EM, which is computationally expensive for sequences of the scale of the mammalian genome. Recently developed spectral algorithms can learn parameters of latent va…

2018-02-07abs ↗pdf ↗

With different genomes available, unsupervised learning algorithms are essential in learning genome-wide biological insights. Especially, the functional characterization of different genomes is essential for us to understand lives. In this book chapter, we review the state-of-the-art unsupervised learning algorithms fo…

2015-08-03abs ↗pdf ↗

Study on the structure of classifier boundaries in DNA sequencing.

problem Understanding the structure of boundaries in a Bayes classifier for DNA sequencing.
method Examined the structure of the boundary in a Bayes classifier applied to DNA sequencing data. Introduced a new measure of uncertainty, Neighbor Similarity.
result The boundary is large and complex, and Neighbor Similarity effectively measures classifier uncertainty.

Study of Betti numbers in prodsimplicial complexes for directed graphs, focusing on DNA recombination.

problem Analyzing Betti numbers in directed graphs for DNA recombination.
method Custom prodsimplicial complexes for acyclic directed graphs, investigating Betti numbers.
result Investigated Betti numbers and cycles in prodsimplicial complexes for DNA recombination.

We categorise coherent band (aka nullification) pathways between knots and 2-component links. Additionally, we characterise the minimal coherent band pathways (with intermediates) between any two knots or 2-component links with small crossing number. We demonstrate these band surgeries for knots and links with small cr…

2014-08-08abs ↗pdf ↗

We propose a dynamic neighborhood aggregation (DNA) procedure guided by (multi-head) attention for representation learning on graphs. In contrast to current graph neural networks which follow a simple neighborhood aggregation scheme, our DNA procedure allows for a selective and node-adaptive aggregation of neighboring …

2019-04-09abs ↗pdf ↗

A novel framework refines diffusion models iteratively for better downstream reward optimization.

problem Optimizing reward functions during inference of diffusion models.
method Iterative refinement process with noising and reward-guided denoising steps.
result Superior empirical performance in protein and DNA design.

Graph Canonical Correlation Analysis improves CCA for multiomics datasets.

problem Limited ability of conventional CCA methods to incorporate structured patterns in cross-correlation matrices.
method Graph Canonical Correlation Analysis (gCCA) calculates canonical correlations based on the graph structure of cross-correlation matrices.
result gCCA outperforms competing CCA methods in simulations and multiomics dataset analysis.

Chirality affects the curvature of molecular networks, influencing their shape and stability.

problem Understanding how chirality influences the curvature of molecular networks.
method Langevin dynamics simulations and constrained gradient optimization of square lattice networks.
result Linking chirality dictates the sign of Gaussian curvature in molecular chainmail networks.

In this paper, we study a geometric/topological measure of knots and links called the nullification number. The nullification of knots/links is believed to be biologically relevant. For example, in DNA topology, one can intuitively regard it as a way to measure how easily a knotted circular DNA can unknot itself throug…

2011-01-06abs ↗pdf ↗

Matrix-variate distributions can intuitively model the dependence structure of matrix-valued observations that arise in applications with multivariate time series, spatio-temporal or repeated measures. This paper develops an Expectation-Maximization algorithm for discriminant analysis and classification with matrix-var…

2019-07-22abs ↗pdf ↗

The research reported in this paper identifies the epigenetic biomarker (methylation beta pattern) of breast cancer. Many cancers are triggered by abnormal gene expression levels caused by aberrant methylation of CpG sites in the DNA. In order to develop early diagnostics of cancer-causing methylations and to develop a…

2019-10-12abs ↗pdf ↗

Authorship verification (AV) is a research subject in the field of digital text forensics that concerns itself with the question, whether two documents have been written by the same person. During the past two decades, an increasing number of proposed AV approaches can be observed. However, a closer look at the respect…

2019-06-24abs ↗pdf ↗

The paper studies pseudo links in genus g handlebodies, generalizing knot theory.

problem Modeling DNA knots with missing crossing information.
method Introducing pseudo links as mixed pseudo links in S^3, generalizing Kauffman bracket polynomial and Alexander theorem.
result The theory of pseudo links is closely related to singular links and can be applied to study singular links in genus g handlebodies.

Novel U-learning method for predicting continuous outcomes from high-dimensional data.

problem Challenges in making valid inferences on predictions from high-dimensional inputs.
method U-learning via combinatory multi-subsampling for ensemble predictions and confidence intervals.
result Valid inferences on predictions from Lasso and neural networks.