@article{11125, abstract = {Although nuclear envelope (NE) assembly is known to require the GTPase Ran, the membrane fusion machinery involved is uncharacterized. NE assembly involves formation of a reticular network on chromatin, fusion of this network into a closed NE and subsequent expansion. Here we show that p97, an AAA-ATPase previously implicated in fusion of Golgi and transitional endoplasmic reticulum (ER) membranes together with the adaptor p47, has two discrete functions in NE assembly. Formation of a closed NE requires the p97–Ufd1–Npl4 complex, not previously implicated in membrane fusion. Subsequent NE growth involves a p97–p47 complex. This study provides the first insights into the molecular mechanisms and specificity of fusion events involved in NE formation.}, author = {HETZER, Martin W and Meyer, Hemmo H. and Walther, Tobias C. and Bilbao-Cortes, Daniel and Warren, Graham and Mattaj, Iain W.}, issn = {1476-4679}, journal = {Nature Cell Biology}, keywords = {Cell Biology}, number = {12}, pages = {1086--1091}, publisher = {Springer Nature}, title = {{Distinct AAA-ATPase p97 complexes function in discrete steps of nuclear assembly}}, doi = {10.1038/ncb1201-1086}, volume = {3}, year = {2001}, } @article{11892, abstract = {We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time 𝑜(𝑛√) per operation. To be precise, the algorithm uses O(n1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and bipartiteness in amortized time O(n1/3 log n) per update, with O(1) worst case time per query.}, author = {Henzinger, Monika H and King, Valerie}, issn = {1095-7111}, journal = {SIAM Journal on Computing}, number = {2}, pages = {364--374}, publisher = {Society for Industrial & Applied Mathematics}, title = {{Maintaining minimum spanning forests in dynamic graphs}}, doi = {10.1137/s0097539797327209}, volume = {31}, year = {2001}, } @inproceedings{11914, abstract = {Previous studies of the Web graph structure have focused on the graph structure at the level of individual pages. In actuality the Web is a hierarchically nested graph, with domains, hosts and Web sites introducing intermediate levels of affiliation and administrative control. To better understand the growth of the Web we need to understand its macro-structure, in terms of the linkage between Web sites. We approximate this by studying the graph of the linkage between hosts on the Web. This was done based on snapshots of the Web taken by Google in Oct 1999, Aug 2000 and Jun 2001. The connectivity between hosts is represented by a directed graph, with hosts as nodes and weighted edges representing the count of hyperlinks between pages on the corresponding hosts. We demonstrate how such a "hostgraph" can be used to study connectivity properties of hosts and domains over time, and discuss a modified "copy model" to explain observed link weight distributions as a function of subgraph size. We discuss changes in the Web over time in the size and connectivity of Web sites and country domains. We also describe a data mining application of the hostgraph: a related host finding algorithm which achieves a precision of 0.65 at rank 3.}, author = {Bharat, K. and Chang, Bay-Wei and Henzinger, Monika H and Ruhl, M.}, booktitle = {1st IEEE International Conference on Data Mining}, isbn = {0-7695-1119-8}, issn = {15504786}, location = {San Jose, CA, United States}, pages = {51--58}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{Who links to whom: Mining linkage between Web sites}}, doi = {10.1109/ICDM.2001.989500}, year = {2001}, } @misc{3507, abstract = {A molecular classification method is based on a space filling description of a molecule. The three dimensional body corresponding to the space filling molecular structure is divided into Voronoi regions to provide a basis for efficiently processing local structural information. A Delaunay triangulation provides a basis for systematically processing information relating to the Voronoi regions into shape descriptors in the form of topological elements. Preferably, additional shape and/or property descriptors are included in the classification method. The classification methods generally are used to identify similarities between molecules that can be used as property predictors for a variety of applications. Generally, the property predictions are the basis for selection of compounds for incorporation into efficacy evaluations.}, author = {Liang, Jie and Edelsbrunner, Herbert}, title = {{Molecular classification for property prediction}}, year = {2001}, } @book{3586, abstract = {The book combines topics in mathematics (geometry and topology), computer science (algorithms), and engineering (mesh generation). The original motivation for these topics was the difficulty faced (both conceptually and in the technical execution) in any attempt to combine elements of combinatorial and of numerical algorithms. Mesh generation is a topic where a meaningful combination of these different approaches to problem solving is inevitable. The book develops methods from both areas that are amenable to combination, and explains recent breakthrough solutions to meshing that fit into this category.The book should be an ideal graduate text for courses on mesh generation. The specific material is selected giving preference to topics that are elementary, attractive, lend themselves to teaching, useful, and interesting.}, author = {Edelsbrunner, Herbert}, isbn = {0-521-79309-2}, pages = {190}, publisher = {Cambridge University Press}, title = {{Geometry and Topology for Mesh Generation}}, doi = {10.1017/CBO9780511530067}, volume = {7}, year = {2001}, }