Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Analysis of allergenic components of Bermuda grass pollen by monoclonal antibodies (1991)
    Oxford, UK : Blackwell Publishing Ltd
    Allergy 46 (1991), S. 0 
    Details
    ISSN: 1398-9995
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Medicine
    Notes: A panel of 16 monoclonal antibodies (MoAbs) directed against Bermuda grass (Cynodon dactylon) pollen (BGP) were generated for identification and purification of the major allergenic components of the eliciting antigen (Ag). Radioimmunoprecipitation (RIP) analysis revealed that there were at least eight antigenic components with molecular weights (MW) ranging from 12 kilodalton (12 kDa) to 200 kDa. Each of these components has distinct biochemical characteristics based on sodium dodecyl sulfate – polyacrylamide gel electrophoresis (SDS-PAGE) and isoelectric focusing(IEF). Among them, Cyn d Bd67K and Cyn d Bd58K were basic proteins, Cyn d Bd35K consisted of at least four isomeric components with isoelectric points ranging from 6.2 to 7.2. The other antigens Cyn d Bd68K, 48K, 38K, Cyn d Bd200K, Cyn d Bd46K, Cyn d Bd25K and Cyn d Bd12K) were all acidic proteins. The IgE binding capacity of all these antigens was determined with sera from 11 BGP-allergics by using a modified radioallergosorbent test. All but one of the antigens (Cyn d Bd200K) were found to react with human IgE from sera of BGP-allergic patients. Among those human IgE-binding molecules, Cyn d Bd35K. reacted with allergic sera most frequently (10 of 11), followed by Cyn d Bd58K (8 of 11) and Cyn d Bd46K (7 of 11) respectively. Our results suggest that Cyn d Bd35K, Cyn d Bd58K, and Cyn d Bd46K are major allergens of BGP, and the MoAbs we obtained should be valuable tools for further purificaiton of these allergens.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1398-9995.1991.tb00615.x
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A unique human IgE-binding epitope on the Bermuda grass pollen recognized by mouse lambda-type monoclonal antibodies (1991)
    Oxford, UK : Blackwell Publishing Ltd
    Clinical & experimental allergy 21 (1991), S. 0 
    Details
    ISSN: 1365-2222
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Medicine
    Notes: A group of six mouse monoclonal antibodies (MoAbs) with the unusual lambda-type light chain were generated by fusion of NS-1 cells with splenic cells derived from BALB/c mice immunized with crude extracts of Bermuda grass pollen (BGP). Four of them were IgG1, one was IgG2b, and one was IgG3. Binding inhibition assay showed that they recognized the same (or very similar) epitope. Using sera from BGP-allergic patients, it was found that the specific binding between the IgE antibodies and the MoAb 26–11-fixed antigen could be blocked by MoAb 26–11 itself and another MoAb 9–13 in a dose-dependent manner. It appears that the epitope recognized by the lambda-type MoAbs is a human IgE-binding antigenic determinant. Further physicochemical analyses showed that this epitope was stable under heat but sensitive to treatments of sodium periodate and proteinase K. Results from these studies indicate that this unique epitope which leads to the generation of lambda-type MoAbs is part of a glycoprotein.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1365-2222.1991.tb01692.x
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Geometric complexity of some location problems (1986)
    Springer
    Algorithmica 1 (1986), S. 193-211 
    Details
    ISSN: 1432-0541
    Keywords: Location problem ; 1-line center ; Maximum gap ; Computational geometry ; Lower bound
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a set ofn demand points with weightW i ,i = 1,2,...,n, in the plane, we consider several geometric facility location problems. Specifically we study the complexity of the Euclidean 1-line center problem, discrete 1-point center problem and a competitive location problem. The Euclidean 1-line center problem is to locate a line which minimizes the maximum weighted distance from the line (or the center) to the demand points. The discrete 1-point center problem is to locate one of the demand points so as to minimize the maximum unweighted distance from the point to other demand points. The competitive location problem studied is to locate a new facility point to compete against an existing facility so that a certain objective function is optimized. An Ω(n logn) lower bound is proved for these problems under appropriate models of computation. Efficient algorithms for these problems that achieve the lower bound and other related problems are also given.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01840442
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains (1998)
    Springer
    Algorithmica 20 (1998), S. 319-352 
    Details
    ISSN: 1432-0541
    Keywords: Key words. Geodesic Voronoi diagrams, Shortest paths, Polygon triangulation, Topological plane sweep, Computational geometry.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. We introduce a new method for computing the geodesic Voronoi diagram of point sites in a simple polygon and other restricted polygonal domains. Our method combines a sweep of the polygonal domain with the merging step of a usual divide-and-conquer algorithm. The time complexity is O((n+k) log(n+k)) where n is the number of vertices and k is the number of points, improving upon previously known bounds. Space is O(n+k) . Other polygonal domains where our method is applicable include (among others) a polygonal domain of parallel disjoint line segments and a polygonal domain of rectangles in the L 1 metric.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00009199
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    A Faster One-Dimensional Topological Compaction Algorithm with Jog Insertion (2000)
    Springer
    Algorithmica 28 (2000), S. 390-421 
    Details
    ISSN: 1432-0541
    Keywords: Key words. VLSI, Homotopic compaction, Rubber-band equivalent.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. We consider the problem of one-dimensional topological compaction with jog insertions. By combining both geometric and graph-theoretic approaches we present a faster and simpler algorithm to improve over previous results. The compaction algorithm takes as input a sketch consisting of a set F of features and a set W of wires, and minimizes the horizontal width of the sketch while maintaining its routability. The algorithm consists of the following steps: constructing a horizontal constraint graph, computing all possible jog positions, computing the critical path, relocating the features, and reconstructing a new sketch homotopic to the input sketch, which is suitable for detailed routing. The algorithm runs in O(|F| ⋅ |W|) worst-case time and space, which is asymptotically optimal in the worst case. Experimental results are also presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s004530010044
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Parallel geometric algorithms on a mesh-connected computer (1990)
    Springer
    Algorithmica 5 (1990), S. 155-177 
    Details
    ISSN: 1432-0541
    Keywords: Parallel algorithms ; Computational geometry ; Mesh-connected computer ; Multipoint location ; Voronoi diagrams
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We show that a number of geometric problems can be solved on a √n × √n mesh-connected computer (MCC) inO(√n) time, which is optimal to within a constant factor, since a nontrivial data movement on an MCC requires Ω(√n) time. The problems studied here include multipoint location, planar point location, trapezoidal decomposition, intersection detection, intersection of two convex polygons, Voronoi diagram, the largest empty circle, the smallest enclosing circle, etc. TheO(√n) algorithms for all of the above problems are based on the classical divide-and-conquer problem-solving strategy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01840383
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Point Set pattern matching ind-dimensions (1995)
    Springer
    Algorithmica 13 (1995), S. 387-404 
    Details
    ISSN: 1432-0541
    Keywords: Pattern matching ; Circular sorting ; Subset similarity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we apply computational geometry techniques to obtain an efficient algorithm for the following point set pattern matching problem. Given a setS ofn points and a setP ofk points in thed-dimensional Euclidean space, determine whetherP matches anyk-subset ofS, where a match can be any similarity, i.e., the setP is allowed to undergo translation, rotation, reflection, and global scaling. Motivated by the need to traverse the sets in an orderly fashion to shun exponential complexity, we circumvent the lack of a total order for points in high-dimensional spaces by using an extension of one-dimensional sorting to higher dimensions (which we call “circular sorting”). This mechanism enables us to achieve the orderly traversal we sought. An optimal algorithm (in time and space) is described for performing circular sorting in arbitrary dimensions. The time complexity of the resulting algorithm for point set pattern matching is O(n logn+kn) for dimension one and O(knd) for dimensiond≥2.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01293487
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Two-Way and Multiway Partitioning of a Set of Intervals for Clique-Width Maximization (1999)
    Springer
    Algorithmica 23 (1999), S. 187-210 
    Details
    ISSN: 1432-0541
    Keywords: Key words. Interval graphs, Partitioning, Clique-width, Sleep mode.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. For a set S of intervals, the clique-interva I S is defined as the interval obtained from the intersection of all the intervals in S , and the clique-width quantity w S is defined as the length of I S . Given a set S of intervals, it is straightforward to compute its clique-interval and clique-width. In this paper we study the problem of partitioning a set of intervals in order to maximize the sum of the clique-widths of the partitions. We present an O(n log n) time algorithm for the balanced bipartitioning problem, and an O(k n 2 ) time algorithm for the k -way unbalanced partitioning problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00009257
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (1995)
    Springer
    Algorithmica 14 (1995), S. 429-441 
    Details
    ISSN: 1432-0541
    Keywords: Shortest paths ; Interval graphs ; Circular-arc graphs ; Union-find algorithms ; Minimum circle cover
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We give the first linear-time algorithm for computing single-source shortest paths in a weighted interval or circular-arc graph, when we are given the model of that graph, i.e., the actual weighted intervals or circular-arcsand the sorted list of the interval endpoints. Our algorithm solves this problem optimally inO(n) time, wheren is the number of intervals or circular-arcs in a graph. An immediate consequence of our result is anO(qn + n logn)-time algorithm for the minimum-weight circle-cover problem, whereq is the minimum number of arcs crossing any point on the circle; then logn term in this time complexity is from a preprocessing sorting step when the sorted list of endpoints is not given as part of the input. The previously best time bounds were0(n logn) for this shortest paths problem, andO(qn logn) for the minimum-weight circle-cover problem. Thus we improve the bounds of both problems. More importantly, the techniques we give hold the promise of achieving similar (logn)-factor improvements in other problems on such graphs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01192049
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems (2000)
    Springer
    Algorithmica 26 (2000), S. 263-289 
    Details
    ISSN: 1432-0541
    Keywords: Key words. Parallel algorithms, Maximum matching problems, Interval graphs, Complement graphs, EREW PRAM, Hypercubes.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. Given a set of n intervals representing an interval graph, the problem of finding a maximum matching between pairs of disjoint (nonintersecting) intervals has been considered in the sequential model. In this paper we present parallel algorithms for computing maximum cardinality matchings among pairs of disjoint intervals in interval graphs in the EREW PRAM and hypercube models. For the general case of the problem, our algorithms compute a maximum matching in O( log 3 n) time using O(n/ log 2 n) processors on the EREW PRAM and using n processors on the hypercubes. For the case of proper interval graphs, our algorithm runs in O( log n ) time using O(n) processors if the input intervals are not given already sorted and using O(n/ log n ) processors otherwise, on the EREW PRAM. On n -processor hypercubes, our algorithm for the proper interval case takes O( log n log log n ) time for unsorted input and O( log n ) time for sorted input. Our parallel results also lead to optimal sequential algorithms for computing maximum matchings among disjoint intervals. In addition, we present an improved parallel algorithm for maximum matching between overlapping intervals in proper interval graphs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s004539910013
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...