scispace - formally typeset
Search or ask a question
Institution

University of California

EducationOakland, California, United States
About: University of California is a education organization based out in Oakland, California, United States. It is known for research contribution in the topics: Population & Layer (electronics). The organization has 55175 authors who have published 52933 publications receiving 1491169 citations. The organization is also known as: UC & University of California System.


Papers
More filters
Posted Content
TL;DR: There exists a nearly-optimal fixed-parameter tractable algorithm for enumerating all maximal cliques, parametrized by degeneracy, and this algorithm matches the Θ(d(n − d)3 d/3) worst-case output size of the problem whenever n − d = Ω(n).
Abstract: The degeneracy of an $n$-vertex graph $G$ is the smallest number $d$ such that every subgraph of $G$ contains a vertex of degree at most $d$. We show that there exists a nearly-optimal fixed-parameter tractable algorithm for enumerating all maximal cliques, parametrized by degeneracy. To achieve this result, we modify the classic Bron--Kerbosch algorithm and show that it runs in time $O(dn3^{d/3})$. We also provide matching upper and lower bounds showing that the largest possible number of maximal cliques in an $n$-vertex graph with degeneracy $d$ (when $d$ is a multiple of 3 and $n\ge d+3$) is $(n-d)3^{d/3}$. Therefore, our algorithm matches the $\Theta(d(n-d)3^{d/3})$ worst-case output size of the problem whenever $n-d=\Omega(n)$.

267 citations

Patent
14 Jun 1991
TL;DR: Peptoids are polymers comprised of monomer units wherein the monomer unit include at least some substitute amino acids and may include conventional amino acids as discussed by the authors, and they can be synthesized in large numbers so as to provide libraries of peptoids which can be screened in order to isolate peptoids of desired biological activity.
Abstract: Peptoids are provided which are polymers comprised of monomer units wherein the monomer units include at least some substitute amino acids and may include conventional amino acids. The peptoids can be synthesized in large numbers so as to provide libraries of peptoids which can be screened in order to isolate peptoids of desired biological activity. Certain peptoids are designed to mimic as closely as possible the activity of known proteins. Other peptoids are designed so as to have greater or lesser activity than known proteins and may be designed so as to block known receptor sites and/or elicit a desired immunogenic response and thereby act as vaccines. A range of different amino acid substitutes are disclosed, as are their methods of synthesis and methods of using such amino acid substitutes in the synthesis of peptoids and peptoid libraries. Methods of screening the libraries in order to obtain desired peptoids of a particular biological activity are also disclosed. The peptoids are preferably linked to a pharmaceutically active drug forming a conjugate with increased binding affinity to a particular biological receptor site.

266 citations

Journal ArticleDOI
TL;DR: In this review, all current knowledge on this class of enzymes that post-translationally install a 4'-phosphopantetheine arm on various carrier proteins are discussed.

265 citations

Book ChapterDOI
07 Mar 2002
TL;DR: Simulation results show that the dissemination tree has close to the optimal number of replicas, good load distribution, small delay and bandwidth penalties for update multicast compared with the ideal case: static replica placement on IP multicast.
Abstract: In this paper, we propose the dissemination tree, a dynamic content distribution system built on top of a peer-to-peer location service. We present a replica placement protocol that builds the tree while meeting QoS and server capacity constraints. The number of replicas as well as the delay and bandwidth consumption for update propagation are significantly reduced. Simulation results show that the dissemination tree has close to the optimal number of replicas, good load distribution, small delay and bandwidth penalties for update multicast compared with the ideal case: static replica placement on IP multicast.

265 citations


Authors

Showing all 55232 results

NameH-indexPapersCitations
Meir J. Stampfer2771414283776
George M. Whitesides2401739269833
Michael Karin236704226485
Fred H. Gage216967185732
Rob Knight2011061253207
Martin White1962038232387
Simon D. M. White189795231645
Scott M. Grundy187841231821
Peidong Yang183562144351
Patrick O. Brown183755200985
Michael G. Rosenfeld178504107707
George M. Church172900120514
David Haussler172488224960
Yang Yang1712644153049
Alan J. Heeger171913147492
Network Information
Related Institutions (5)
Cornell University
235.5K papers, 12.2M citations

95% related

University of California, Berkeley
265.6K papers, 16.8M citations

94% related

University of Minnesota
257.9K papers, 11.9M citations

94% related

University of Wisconsin-Madison
237.5K papers, 11.8M citations

94% related

Stanford University
320.3K papers, 21.8M citations

93% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202322
2022105
2021775
20201,069
20191,225
20181,684