Search results
3 dni temu · The relationship matrix computed by --make-rel/--make-grm-list/--make-grm-bin can be used to reliably identify close relations within a single population, if your MAFs are decent.
5 dni temu · We present the first combinatorial proof of the Graham-Pollak Formula for the determinant of the distance matrix of a tree, via sign-reversing involutions and the Lindström-Gessel-Viennot Lemma.
4 dni temu · Abstract: Let $T = ([n], E)$ be a tree and let $D = ( d(i,j) )_{i, j \le n}$ be the distance matrix of $T$. Let $S\subseteq [n]$. Let $S\subseteq [n]$. We give the first combinatorial proof for a formula to compute the principal minor of $D$ indexed by $S$, namely $\det D[S]$.
5 dni temu · I’ve closed out the prior discussion at Compute distance matrix - #9 by Linno but linking it here for context. This may still be a work in progress, but @bernt-matthias is the best person to answer.
3 dni temu · Name LS7B Week 3 Pre-Class Reading Guide Fill out this worksheet as you complete your pre-class assignments. Bring your completed worksheet to class to use as a reference for in-class activities. After completing your pre-class assignments you should be able to: •Explain how genetic distance is different from physical distance on a chromosome.
3 dni temu · distance matrices of block graphs along similar lines and gave bounds on the peak location for some block graphs. In this paper, we extend such results to two other matrices.
5 dni temu · We classify triangle- and pentagon-free distance-regular graphs with diameter d ≥ 2, valency k, and an eigenvalue multiplicity k. In particular, we prove that such a graph is isomorphic to a cycle, a k -cube, a complete bipartite graph minus a matching, ...
