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
Filter
  • 2020-2023  (3)
  • 1990-1994  (1)
  • 1
    ISSN: 1617-4623
    Keywords: Saccharomyces cerevisiae ; TRPI promoter ; Upstream activating sequences ; PGK
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Summary The interactions between different upstream activator sequences (UAS) and the downstream transcriptional elements of the TRP1 promoter were studied. We have inserted the UAS from the PGK gene into a series of TRP1 promoter deletions such that the PGK UAS is positioned at various distances upstream from or replaces the TRP1 UAS (UAST1). We show that activation of the TRP1 transcription unit I by the PGK UAS shows a marked position dependence, which is solely a function of the position of the PGK UAS relative to sequences involved in the determination of the RNA initiation sites in the TRP1 promoter. No cooperative activation is seen when both UASs are present in the promoter; the PGK UAS is dominant and is not repressed by the TRPI negative element. In addition, we show that the PGK and TRP1 UASs interact differently with TATA sequence at the TRP1 RNA initiation site. Our results suggest that these UASs are functionally distinct because they use different mechanisms for activating heterologous promoters.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2021-12-09
    Description: We report our progress on the project for solving larger scale quadratic assignment problems (QAPs). Our main approach to solve large scale NP-hard combinatorial optimization problems such as QAPs is a parallel branch-and-bound method efficiently implemented on a powerful computer system using the Ubiquity Generator(UG) framework that can utilize more than 100,000 cores. Lower bounding procedures incorporated in the branch-and-bound method play a crucial role in solving the problems. For a strong lower bounding procedure, we employ the Lagrangian doubly nonnegative (DNN) relaxation and the Newton-bracketing method developed by the authors’ group. In this report, we describe some basic tools used in the project including the lower bounding procedure and branching rules, and present some preliminary numerical results. Our next target problem is QAPs with dimension at least 50, as we have succeeded to solve tai30a and sko42 from QAPLIB for the first time.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Publication Date: 2022-05-13
    Description: 二次割当問題は線形緩和が弱いことが知られ,強化のため多様な緩和手法が考案されているが,その一つである二重非負値計画緩和( DNN 緩和)及びその解法として近年研究が進んでいるニュートン・ブラケット法を紹介し,それらに基づく分枝限定法の実装及び数値実験結果について報告する.
    Language: Japanese
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Publication Date: 2022-10-28
    Description: Tai256c is the largest unsolved quadratic assignment problem (QAP) instance in QAPLIB; a 1.48% gap remains between the best known feasible objective value and lower bound of the unknown optimal value. This paper shows that the instance can be converted into a 256 dimensional binary quadratic optimization problem (BQOP) with a single cardinality constraint which requires the sum of the binary variables to be 92.The converted BQOP is much simpler than the original QAP tai256c and it also inherits some of the symmetry properties. However, it is still very difficult to solve. We present an efficient branch and bound method for improving the lower bound effectively. A new lower bound with 1.36% gap is also provided.
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    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...