Back to search

Article

A novel, computationally tractable algorithm flags in big matrices every column associated in any way with others or a dependent variable, with much higher power when columns are linked like mutations in chromosomes

2021-09-17

Abstract excerpt

<h4>ABSTRACT</h4> When a data matrix DM has many independent variables IVs, it is not computationally tractable to assess the association of every distinct IV subset with the dependent variable DV of the DM, because the number of subsets explodes combinatorially as IVs increase. But model selection and correcting for multiple tests is complex even with few IVs. DMs in genomics will soon summarize millions of muta...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work
743b131b-5d20-522a-9130-25b26ba64683
DOI
10.1101/2021.09.15.460360
Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest
Interactive article relationship graphSelect a related publication card to move it into the centre and load its closest explainable connections. Solid lines are source-backed structured connections. Dashed lines are semantic discovery signals and are not scientific evidence.
A novel, computationally tractable algorithm flags in big matrices every column associated in any way with others or a dependent variable, with much higher power when columns are linked like mutations in chromosomesDOI 10.1101/2021.09.15.460360
Select a neighboring publication to make it the new centre.