#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1998

2018

- This year (1)
- Last 5 years (8)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Susanne GrÃ¤slund, Paer Nordlund, +81 authors Kristin C. Gunsalus
- Nature Methods
- 2008

NOTE: In the version of this Review initially published, an author (B. Martin Hallberg) was left off of the author list. This information has been added to the HTML and PDF versions of the Review.Inâ€¦ (More)

- Iva Navratilova, Giuseppe A Papalia, +21 authors David G. Myszka
- Analytical biochemistry
- 2007

A total of 22 individuals participated in this benchmark study to characterize the thermodynamics of small-molecule inhibitor-enzyme interactions using Biacore instruments. Participants were providedâ€¦ (More)

- Fred Feiyu Zhang
- 2011

Gravel and coarse sand make up signifi cant por ons of some environmentally important sediments, but the hydraulic proper es of the sediments are typically obtained in the laboratory using only theâ€¦ (More)

- Fred Feiyu Zhang, Norbert Kartner, Gergely L Lukacs
- Nature Structural Biology
- 1998

Deletion of phenylalanine 508 (Î”F508) in the cystic fibrosis transmembrane-conductance regulator (CFTR) prevents the otherwise functional protein from reaching the plasma membrane and is the leadingâ€¦ (More)

- Lin Liu, Jack C. Tang, Fred Feiyu Zhang, Xing Wang, Baogang J. Xu
- Tropical biomedicine
- 2013

Human schistosomiasis is widespread in tropical and subtropical environments. In this study, a novel open cell with liquid medium perfusion system for electrorotation measurement to detect theâ€¦ (More)

In the last lecture, we introduced the classic problem of maximum cut, where the objective is to find a cut of the given graph with maximum weight. We also saw some techniques give 1/2-approximation,â€¦ (More)

A graph G = (V,E), where V is the set of vertices, and E is the set of edges. An edge e âˆˆ E is an unordered pair (u,v) in undirected graphs, where u,vâˆˆV . In directed graphs, an edge e is an orderedâ€¦ (More)

- Rong Ge, Fred Feiyu Zhang
- 2017

Suppose u, v are different currencies, and the exchange rate is C(u, v) (i.e., 1 unit of v is worth C(u, v) units of u). We set the length of the edge as w(u, v) = logC(u, v). We take the logâ€¦ (More)

On hypergraphs with m hyperedges and n vertices, where p denotes the total size of the hyperedges, we provide the following results: â€¢ We give an algorithm that runs in e O mn2kâˆ’2 time for finding aâ€¦ (More)

For a weighted graph G = (V,E) where we denotes the weight of edge e âˆˆ E, recall Kruskalâ€™s algorithm for computing a minimum spanning tree (MST) of G (if you are having trouble remembering the MSTâ€¦ (More)