David Y. Lin

Learn More
An s-graph is a graph with two kinds of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into paths of arbitrary length (at least one). Given an s-graph B, we study the decision problem Π B whose instance is a graph G and question is " Does G contain a realisation of B as an(More)
Nerve injury, a significant cause of disability, may be treated more effectively using nerve guidance channels containing longitudinally aligned fibers. Aligned, electrospun nanofibers direct the neurite growth of immortalized neural stem cells, demonstrating potential for directing regenerating neurites. However, no study of neurite guidance on these(More)
Many microbial pathogens deliver effector proteins via the type III secretion system into infected host cells. Elucidating the function of these effectors is essential for our understanding of pathogenesis. Here, we describe biochemical and structural characterization of an effector protein (NleL) from Escherichia coli O157:H7, a widespread pathogen causing(More)
Bacteria secrete peptides and proteins to communicate, to poison competitors, and to manipulate host cells. Among the various protein-translocation machineries, the peptidase-containing ATP-binding cassette transporters (PCATs) are appealingly simple. Each PCAT contains two peptidase domains that cleave the secretion signal from the substrate, two(More)
An s-graph is a graph with two kinds of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into paths of arbitrary length (at least one). Given an s-graph B, we study the decision problem Π B whose instance is a graph G and question is ''Does G contain a realisation of B as an(More)
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into paths of length at least one. Given an s-graph B, we study the decision problem Π B. Its instance is any graph G, its question is " Does G contains a realisation of B as an induced(More)
Inferences are often made from samples with substantial amounts of missing data. Scharfstein, Rotnitzky, and Robins (1999)—hereafter SRR—have substantially increased our understanding of this important problem. In principle, of course, missing data are just that—missing—and cannot be reconstructed after the fact. On the other hand, if covariates are(More)
  • 1