The number of base pairs in the 16S rRNA secondary structures of 51 bacterial sequences was counted, and the number of hydrogen bonds was estimated. The number of hydrogen bonds was highly correlated with the optimal ...The number of base pairs in the 16S rRNA secondary structures of 51 bacterial sequences was counted, and the number of hydrogen bonds was estimated. The number of hydrogen bonds was highly correlated with the optimal growth temperature (OGT) rather than with the G + C content. Paired and unpaired nucleotides in mesophiles were compared to those in thermophiles. OGT exhibited a relationship with paired nucleotides but not with unpaired nucleotides. The total number of paired as well as unpaired nucleotides in mesophiles was very similar to that in thermophiles. However, the components in base pairs in mesophiles significantly differed from those in thermophiles. As compared with mesophiles, the number of G·C base pairs in thermophiles was high whereas that of A·U base pairs was low. In this study, we showed that hydrogen bonds are important for stabilizing 16S rRNAs at high temperatures.展开更多
In the research of service composition,it demands efficient algorithms that not only retrieve correct service compositions automatically from thousands of services but also satisfy the quality requirements of differen...In the research of service composition,it demands efficient algorithms that not only retrieve correct service compositions automatically from thousands of services but also satisfy the quality requirements of different service users.However,most approaches treat these two aspects as two separate problems,automatic service composition and service selection.Although the latest researches realize the restriction of this separate view and some specific methods are proposed,they still suffer from serious limitations in scalability and accuracy when addressing both requirements simultaneously.In order to cope with these limitations and efficiently solve the combined problem which is known as QoS-aware or QoS-driven automatic service composition problem,we propose a new graph search problem,single-source optimal directed acyclic graphs （DAGs）,for the first time.This novel single-source optimal DAGs （SSOD） problem is similar to,but more general than the classical single-source shortest paths （SSSP） problem.In this paper,a new graph model of SSOD problem is proposed and a Sim-Dijkstra algorithm is presented to address the SSOD problem with the time complexity of O（n log n ＋ m） （n and m are the number of nodes and edges in the graph respectively）,and the proofs of its soundness.It is also directly applied to solve the QoS-aware automatic service composition problem,and a service composition tool named QSynth is implemented.Evaluations show that Sim-Dijkstra algorithm achieves superior scalability and efficiency with respect to a large variety of composition scenarios,even more efficient than our worklist algorithm that won the performance championship of Web Services Challenge 2009.展开更多
文摘The number of base pairs in the 16S rRNA secondary structures of 51 bacterial sequences was counted, and the number of hydrogen bonds was estimated. The number of hydrogen bonds was highly correlated with the optimal growth temperature (OGT) rather than with the G + C content. Paired and unpaired nucleotides in mesophiles were compared to those in thermophiles. OGT exhibited a relationship with paired nucleotides but not with unpaired nucleotides. The total number of paired as well as unpaired nucleotides in mesophiles was very similar to that in thermophiles. However, the components in base pairs in mesophiles significantly differed from those in thermophiles. As compared with mesophiles, the number of G·C base pairs in thermophiles was high whereas that of A·U base pairs was low. In this study, we showed that hydrogen bonds are important for stabilizing 16S rRNAs at high temperatures.
基金Supported by the National Basic Research 973 Program of China under Grant No.2007CB-310805the National Natural Science Foundation of China under Grant No.61070027+2 种基金the Beijing Natural Science Foundation project under Grant No.4092043the Scienceand Technology Project of State Grid Information&Telecommunication Company Ltd.under Grant No.SGIT[2010]449the Planned Science and Technology Project of Guangdong Province,China under Grant No.2010B050100009
文摘In the research of service composition,it demands efficient algorithms that not only retrieve correct service compositions automatically from thousands of services but also satisfy the quality requirements of different service users.However,most approaches treat these two aspects as two separate problems,automatic service composition and service selection.Although the latest researches realize the restriction of this separate view and some specific methods are proposed,they still suffer from serious limitations in scalability and accuracy when addressing both requirements simultaneously.In order to cope with these limitations and efficiently solve the combined problem which is known as QoS-aware or QoS-driven automatic service composition problem,we propose a new graph search problem,single-source optimal directed acyclic graphs （DAGs）,for the first time.This novel single-source optimal DAGs （SSOD） problem is similar to,but more general than the classical single-source shortest paths （SSSP） problem.In this paper,a new graph model of SSOD problem is proposed and a Sim-Dijkstra algorithm is presented to address the SSOD problem with the time complexity of O（n log n ＋ m） （n and m are the number of nodes and edges in the graph respectively）,and the proofs of its soundness.It is also directly applied to solve the QoS-aware automatic service composition problem,and a service composition tool named QSynth is implemented.Evaluations show that Sim-Dijkstra algorithm achieves superior scalability and efficiency with respect to a large variety of composition scenarios,even more efficient than our worklist algorithm that won the performance championship of Web Services Challenge 2009.
