4 papers
Erdős-Gallai-type results for total monochromatic connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A graph is said to be {\it total-colored} if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a {\it total monochromatically-connecting color…
A Unified Model for Differential Expression Analysis of RNA-seq Data via L1-Penalized Linear Regression
Kefei Liu, Jieping Ye, Yang Yang +2
The RNA-sequencing (RNA-seq) is becoming increasingly popular for quantifying gene expression levels. Since the RNA-seq measurements are relative in nature, between-sample normaliz…
Good upper bounds for the total rainbow connection of graphs
Hui Jiang, Xueliang Li, Yingying Zhang
A total-colored graph is a graph such that both all edges and all vertices of are colored. A path in a total-colored graph is a total rainbow path if its edges and inte…
Robust estimation of isoform expression with RNA-Seq data
Jun Li, Hui Jiang
Qualifying gene and isoform expression is one of the primary tasks for RNA-Seq experiments. Given a sequence of counts representing numbers of reads mapped to different positions (…