Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.15375 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929490287919104 |
|---|---|
| author | Salahub, Chris Uhlmann, Jeffrey |
| author_facet | Salahub, Chris Uhlmann, Jeffrey |
| contents | We propose a general method for optimally approximating an arbitrary matrix $\mathbf{M}$ by a structured matrix $\mathbf{T}$ (circulant, Toeplitz/Hankel, etc.) and examine its use for estimating the spectra of genomic linkage disequilibrium matrices. This application is prototypical of a variety of genomic and proteomic problems that demand robustness to incomplete biosequence information. We perform a simulation study and corroborative test of our method using real genomic data from the Mouse Genome Database. The results confirm the predicted utility of the method and provide strong evidence of its potential value to a wide range of bioinformatics applications. Our optimal general matrix approximation method is expected to be of independent interest to an even broader range of applications in applied mathematics and engineering. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_15375 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Optimal Structured Matrix Approximation for Robustness to Incomplete Biosequence Data Salahub, Chris Uhlmann, Jeffrey Applications Data Structures and Algorithms 92-08 J.3 We propose a general method for optimally approximating an arbitrary matrix $\mathbf{M}$ by a structured matrix $\mathbf{T}$ (circulant, Toeplitz/Hankel, etc.) and examine its use for estimating the spectra of genomic linkage disequilibrium matrices. This application is prototypical of a variety of genomic and proteomic problems that demand robustness to incomplete biosequence information. We perform a simulation study and corroborative test of our method using real genomic data from the Mouse Genome Database. The results confirm the predicted utility of the method and provide strong evidence of its potential value to a wide range of bioinformatics applications. Our optimal general matrix approximation method is expected to be of independent interest to an even broader range of applications in applied mathematics and engineering. |
| title | Optimal Structured Matrix Approximation for Robustness to Incomplete Biosequence Data |
| topic | Applications Data Structures and Algorithms 92-08 J.3 |
| url | https://arxiv.org/abs/2310.15375 |