get_major_eigenvalue

Provides an implementation of the framework of reversed graph embedding (RGE) which projects data into a reduced dimensional space while constructs a principal tree which passes through the middle of the data simultaneously. DDRTree shows superiority to alternatives (Wishbone, DPT) for inferring the ordering as well as the intrinsic structure of the single cell genomics data. In general, it could be used to reconstruct the temporal progression as well as bifurcation structure of any datatype.

Brent Ewing

DDRTree

Learning Principal Graphs with DDRTree

Xiaojie Qiu

Cole Trapnell

Qi Mao

Li Wang

get_major_eigenvalue function

<dl><dt>C</dt>
<dd>data matrix used for eigendecomposition</dd>
<dt>L</dt>
<dd>number for the top eigenvalues</dd></dl>

Arguments

Get the top L eigenvalues — get_major_eigenvalue

<dl>

<dt>C</dt>
<dd>data matrix used for eigendecomposition</dd>


<dt>L</dt>
<dd>number for the top eigenvalues</dd>

</dl>

Get the top L eigenvalues

get_major_eigenvalue: Get the top L eigenvalues

Description

Usage

Arguments