Cover Image

Optimal Structured Matrix Approximation for Robustness to Incomplete Biosequence Data

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Salahub, Chris, Uhlmann, Jeffrey
Format:	Preprint
Published:	2023
Subjects:	Applications Data Structures and Algorithms 92-08 J.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Graded Projection Recursion (GPR): Corrections, Obstructions, and Conservative Approximate Matrix Multiplication
by: Uhlmann, Jeffrey
Published: (2025)

Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model
by: Bailey, Lora, et al.
Published: (2024)

Statistics-Friendly Confidentiality Protection for Establishment Data, with Applications to the QCEW
by: Webb, Kaitlyn, et al.
Published: (2025)

Testing the Fairness-Accuracy Improvability of Algorithms
by: Auerbach, Eric, et al.
Published: (2024)

Polynomial-Time Solutions for Longest Common Subsequence Related Problems Between a Sequence and a Pangenome Graph
by: Li, Xingfu, et al.
Published: (2026)

Optimal Approximate Matrix Multiplication over Sliding Window
by: Xian, Haoming, et al.
Published: (2025)

A Vector Representation for Phylogenetic Trees
by: Chauve, Cedric, et al.
Published: (2024)

The Effect of Hydration and Dynamics on the Mass Density of Single Proteins
by: McAllister, Cameron C. W., et al.
Published: (2025)

Continual Release of Differentially Private Synthetic Data from Longitudinal Data Collections
by: Bun, Mark, et al.
Published: (2023)

Implicit Decision Diagrams
by: Rudich, Isaac, et al.
Published: (2026)

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
by: Ardizzoni, Stefano, et al.
Published: (2021)

Numerical Twin with Two Dimensional Ornstein--Uhlenbeck Processes of Transient Oscillations in EEG signal
by: Michel, P. O., et al.
Published: (2025)

MixINN: Accelerating Plant Breeding by Combining Mixed Models and Deep Learning for Interaction Prediction
by: Potze, Aike, et al.
Published: (2026)

Optimal Approximate Matrix Multiplication over Sliding Windows
by: Yao, Ziqi, et al.
Published: (2025)

U-index: A Universal Indexing Framework for Matching Long Patterns
by: Ayad, Lorraine A. K., et al.
Published: (2025)

The Power of Graph Doubling: Computing Ultrabubbles in a Bidirected Graph by Reducing to Weak Superbubbles
by: Schmidt, Sebastian, et al.
Published: (2026)

On the Fair Comparison of Optimization Algorithms in Different Machines
by: Arza, Etor, et al.
Published: (2023)

Improved Sparse Recovery for Approximate Matrix Multiplication
by: Uffenheimer, Yahel, et al.
Published: (2026)

Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations
by: Ferragina, Paolo, et al.
Published: (2025)

Towards Efficient Data Structures for Approximate Search with Range Queries
by: Kian, Ladan, et al.
Published: (2026)

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
by: Liu, Yang P.
Published: (2024)

Polylogarithmic Approximation for Robust s-t Path
by: Li, Shi, et al.
Published: (2023)

Optimal rolling of fair dice using fair coins
by: Huber, Mark, et al.
Published: (2024)

Optimal 4-Approximation for the Correlated Pandora's Problem
by: Bansal, Nikhil, et al.
Published: (2025)

Optimal FPT-Approximability for Modular Linear Equations
by: Dabrowski, Konrad K., et al.
Published: (2026)

Inverse population genetic problems with noise: inferring extent and structure of haplotype blocks from point allele frequencies
by: Clay, Oliver Keatinge
Published: (2024)

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
by: Dai, Jiangqi, et al.
Published: (2025)

The 2020 US Decennial Census is more private than you (might) think
by: Su, Buxin, et al.
Published: (2024)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
by: Mallek, Nadym, et al.
Published: (2025)

An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS
by: Koo, Jaehyun
Published: (2024)

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
by: Kempa, Dominik, et al.
Published: (2023)

Automated Cell Structure Extraction for 3D Electron Microscopy by Deep Learning
by: Kousaka, Jin, et al.
Published: (2024)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
by: Andoni, Alexandr, et al.
Published: (2026)

Entrywise Low-Rank Approximation and Matrix $p \rightarrow q$ Norms via Global Correlation Rounding
by: Anderson, Prashanti, et al.
Published: (2026)

Simple and Optimal Sublinear Algorithms for Mean Estimation
by: Bertolotti, Beatrice, et al.
Published: (2024)

A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
by: Cohen-Addad, Vincent, et al.
Published: (2025)

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
by: Cohen-Addad, Vincent, et al.
Published: (2022)

(Approximate) Matrix Multiplication via Convolutions
by: Uffenheimer, Yahel, et al.
Published: (2025)

Data Structures for Approximate Discrete Fréchet Distance
by: van der Hoog, Ivor, et al.
Published: (2022)

Optimal $e^{(γ+o(1))n}$-Approximation of the Permanent of Positive Semidefinite Matrices
by: Anari, Nima, et al.
Published: (2026)