Kai Ying

Mader proved that, for any tree T $T$ of order m $m$ , every k $k$ -connected graph G $G$ with δ ( G ) ≥ 2 ( k + m − 1 ) 2 + m − 1 $\delta (G)\ge 2{(k+m-1)}^{2}+m-1$ contains a subtree T ′ ≅ T ${T}^{^{\prime} }\cong T$ such that G − V ( T ′ ) $G-V({T}^{^{\prime} })$ is k $k$ -connected. We proved that any graph G $G$ with minimum degree δ ( G ) ≥ 2 k $\delta (G)\ge 2k$ contains k $k$ -connected triples.

Identification of copy number variants and genome content differences In addition to this large region of genome variation on chromosome 6, we expected to identify numerous smaller copy-number variants (CNVs). As seen in the analysis of several well-annotated BACs, there are probes every ∼400 bp in low-copy genomic DNA (Figure 1). CNVs can be discovered by assessing the behavior of adjacent probes to identify segments of DNA that give consistently altered signal from two genomes.