Library

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
    ISSN: 1432-1335
    Keywords: Key words Acute lymphoblastic leukemia ; Methotrexate polyglutamates ; Thymidylate synthase ; Salvage pathway ; Relapse
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Abstract Purpose: In about 25% of patients suffering from acute lymphoblastic leukemia (ALL) treatment failures occur that are most likely due to development of resistance to methotrexate (MTX). Blasts from patients with ALL were evaluated for MTX uptake, formation of long-chain MTX polyglutamates (MTX-Glu5+6), cytotoxicity and thymidylate synthase inhibition by MTX and compared to blasts from patients with acute myelogenous leukemia (AML). Methods: Radioactively labeled MTX-Glu n were analyzed by means of HPLC. Thymidylate synthase activity was measured by a tritium-release assay. Cytotoxicity was determined by trypan blue exclusion. Results: In most ALL blasts (n = 9) large amounts of MTX-Glu5+6 (1.06–7.03 pmol/107cells) and high cytotoxicity (43.5%–92.7%) were found, while in others small amounts of MTX-Glu5+6 (0.0–0.39 pmol/107cells) caused only weak cytotoxicity (6.0%–27.9%) (n = 5, 2 relapsed patients). Resistance to MTX in blasts from AML patients (n = 5) was also caused by reduced synthesis of MTX-Glu5+6 (0.0–0.42 pmol/107cells). In contrast, some ALL blasts (n = 7, 4 relapsed patients) were able to survive MTX treatment despite large amounts of MTX-Glu5+6 (1.5–5.05 pmol/107cells) and extensive thymidylate synthase inhibition. Conclusions: Since the majority of ALL patients were examined at first diagnosis, an inherent mechanism of resistance seems most likely. We propose a mechanism based on the switch of thymidylate synthesis to the salvage pathway.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    ISSN: 1432-055X
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Die politische Schlagzeile „Die Zukunft heißt Europa” gilt nicht nur für den politischen Bereich, sondern auch für das Fach Anästhesie mit dem Ziel, einen europäischen Standard unter Berücksichtigung nationaler Interessen zu etablieren. Ein wichtiger Aspekt ist die Standardisierung der Ausbildung, die vom European Board of Anesthesiology, Reanimation and Intensive Care , bestehend aus jeweils zwei gewählten Repräsentanten jedes Mitgliedlandes, im Rahmen der Europäischen Union realisiert werden soll. Einen Beitrag zu diesem Ziel könnte der 10. Europäische und 45. Deutsche Anästhesiekongreß geleistet haben, an dem über 6000 Anästhesisten und Intensivmediziner aus knapp 90 Ländern teilgenommen haben. Den Kongreßteilnehmern wurde ein breites Spektrum anästhesiologischer, intensivmedizinischer, schmerztherapeutischer und notfallmedizinischer Beiträge angeboten, die Basiswissen, Ergebnisse experimenteller Studien und aktuelle Themen vorstellten.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Computing 12 (1974), S. 273-283 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A computer programming algorithm is presented which is based on Yen's principle [1] for finding the K loopless paths that have the shortest lengths from one fixed node to another in a network. Several modifications and extensions permitted to construct an extremely efficient algorithm, with regard to the number of necessary memory addresses as well as to the need of operations. The computer time increases linearly with K and is mostly less than the time of Hoffman-Pavley's algorithm [2], moreover, each of the generated paths is loopless. The algorithm published in this paper may be one of the best methods available till now for the solution of the K-shortest paths problem.
    Notes: Zusammenfassung In der vorliegenden Arbeit wird ein neuer Algorithmus zur Bestimmung K-kürzester Wege in einem Graphen vorgestellt. Der Grundgedanke dazu stammt aus einem Verfahren von Jin Y. Yen [1]. Verschiedene Modifikationen und Erweiterungen ermöglichten die Erstellung eines äußerst wirkungsvollen Algorithmus, sowohl hinsichtlich des benötigten Speicherplatzbedarfs, als auch im besonderen hinsichtlich der notwendigen Rechenoperationen. Die Rechenzeiten liegen durchwegs niedriger als etwa die Zeiten des Verfahrens von Hoffman-Pavley [2]. Der hier beschriebene Algorithmus liefert dabei tatsächlich nur schleifenfreie Kantenfolgen; er dürfte damit wohl eine der besten der zur Zeit bekannten Methoden zur Berechnung K-kürzester Wege darstellen.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    ISSN: 1432-1335
    Keywords: Key words Acute lymphoblastic leukemia ; Methotrexate polyglutamates ; Lymphoblast preparation ; Red blood cells
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Abstract Purpose: Blasts isolated from bone marrow aspirates or blood samples of patients with acute lymphoblastic leukemia (ALL) or acute myelogenous leukemia (AML) were compared for uptake of methotrexate (MTX) and formation of MTX polyglutamates (MTX-Glu n ). Red blood cells (RBC) from the same patient samples were also analyzed. Methods: Blasts were isolated by standard density centrifugation. RBC were prepared from the pellet of the same centrifugation. MTX-Glu n were analyzed by means of HPLC and radiochemical quantification. Results: In lymphoblasts isolated from blood, the distribution patterns of MTX-Glu n were the same as in bone marrow lymphoblasts, but the total amount of MTX-Glu n accumulated in blood lymphoblasts was reduced by 41%–51% when compared to the same number of bone marrow lymphoblasts of the same patient. RBC accumulated MTX but no formation of MTX-Glu n occurred. Conclusions: The determination of MTX and MTX-Glu n in lymphoblasts isolated from blood samples of patients with common ALL provides qualitative information on the capacity of the blasts to form MTX-Glu n since distribution patterns of MTX and MTX-Glu n parallel that of bone marrow lymphoblasts. The amounts of MTX-Glu n accumulated, however, were much lower in blood lymphoblasts. Blood lymphoblasts are therefore not useful for a quantitative analysis of MTX-Glu n . The contribution of RBC to MTX and MTX-Glu n in vitro is only marginal and residual RBC in lymphoblast preparations from bone marrow can therefore be ignored.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    ISSN: 1437-1588
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Computing 16 (1976), S. 139-151 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The following algorithm for finding thek-shortest loopless paths from one node to another is a development of the algorithm published in [2]. Though memory need is less, the new algorithm is running is bout 20 times as fast on large networks (1000 nodes and more). The computer time increases linearly withk and about quadratic with the number of nodes on the generated paths.
    Notes: Zusammenfassung Der in der vorliegenden Arbeit vorgestellte Algorithmus zur Ermittlung vonk-kürzesten schleifenfreien Kantenfolgen von einem Anfangsknoten zu einem Endknoten stellt eine Weiterentwicklung des in [2] beschriebenen Verfahrens dar. Bei deutlich geringerem Speicherplatzbedarf konnte die Rechengeschwindigkeit stark gesteigert werden (bei Graphen von 1000 Knoten ungefähr um das 20fache). Die Rechenzeit wächst linear mitk und in etwa quadratisch mit der Knotenzahl der erzeugten Wege.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...