scholarly journals Lattice and Off-Lattice Side Chain Models of Protein Folding: Linear Time Structure Prediction Better than 86% of Optimal

1997 ◽  
Vol 4 (3) ◽  
pp. 241-259 ◽  
Author(s):  
WILLIAM E. HART ◽  
SORIN ISTRAIL
Keyword(s):  
Protein Folding ◽  
Structure Prediction ◽  
Linear Time ◽  
Time Structure ◽  
Side Chain ◽  
Better Than

scholarly journals A Real-Time Structure of Attitude Algorithm for High Dynamic Bodies

2017 ◽  
Vol 2017 ◽  
pp. 1-8
Author(s):  
Xingcheng Li ◽  
Shuangbiao Zhang
Keyword(s):  
Real Time ◽  
Time Structure ◽  
Flow Diagram ◽  
The Real ◽  
Time Problem ◽  
Conventional Structure ◽  
High Dynamic ◽  
Two Stages ◽  
Better Than ◽  
Attitude Matrix

To solve the real-time problem of attitude algorithm for high dynamic bodies, a real-time structure of attitude algorithm is developed by analyzing the conventional structure that has two stages, and a flow diagram of a real-time structure for a Matlab program is provided in detail. During the update of the attitude matrix, the real-time structure saves every element of attitude matrix in minor loop in real time and updates the next attitude matrix based on the previous matrix every subsample time. Thus, the real-time structure avoids lowering updating frequency, though the multisubsample algorithms are used. Simulation and analysis show that the real-time structure of attitude algorithm is better than the conventional structure due to short update time of attitude matrix and small drifting error, and it is more appropriate for high dynamic bodies.

FAULT TOLERANT ROUTING IN HYPERCUBES AND STAR GRAPHS

1996 ◽  
Vol 06 (01) ◽  
pp. 127-136 ◽  
Author(s):  
QIAN-PING GU ◽  
SHIETUNG PENG
Keyword(s):  
Free Path ◽  
Fault Tolerant ◽  
Linear Time ◽  
Time Efficiency ◽  
Routing Problem ◽  
Star Graphs ◽  
Linear Time Algorithms ◽  
Better Than

In this paper, we give two linear time algorithms for node-to-node fault tolerant routing problem in n-dimensional hypercubes Hn and star graphs Gn. The first algorithm, given at most n−1 arbitrary fault nodes and two non-fault nodes s and t in Hn, finds a fault-free path s→t of length at most [Formula: see text] in O(n) time, where d(s, t) is the distance between s and t. Our second algorithm, given at most n−2 fault nodes and two non-fault nodes s and t in Gn, finds a fault-free path s→t of length at most d(Gn)+3 in O(n) time, where [Formula: see text] is the diameter of Gn. When the time efficiency of finding the routing path is more important than the length of the path, the algorithms in this paper are better than the previous ones.

How to Keep an Eye on Small Things

2021 ◽  
pp. 1-24
Author(s):  
Bengt J. Nilsson ◽  
Paweł Żyliński
Keyword(s):  
Linear Time ◽  
Simple Polygon ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Approximation Factor ◽  
Fpt Algorithm ◽  
Optimal Linear ◽  
Small Things ◽  
Set Of Points ◽  
Better Than

We present new results on two types of guarding problems for polygons. For the first problem, we present an optimal linear time algorithm for computing a smallest set of points that guard a given shortest path in a simple polygon having [Formula: see text] edges. We also prove that in polygons with holes, there is a constant [Formula: see text] such that no polynomial-time algorithm can solve the problem within an approximation factor of [Formula: see text], unless P=NP. For the second problem, we present a [Formula: see text]-FPT algorithm for computing a shortest tour that sees [Formula: see text] specified points in a polygon with [Formula: see text] holes. We also present a [Formula: see text]-FPT approximation algorithm for this problem having approximation factor [Formula: see text]. In addition, we prove that the general problem cannot be polynomially approximated better than by a factor of [Formula: see text], for some constant [Formula: see text], unless P [Formula: see text]NP.

Backbone dihedral angles prediction servers for protein early-stage structure prediction

2019 ◽  
Vol 15 (4) ◽  
Author(s):  
Tomasz Smolarczyk ◽  
Katarzyna Stapor ◽  
Irena Roterman-Konieczna
Keyword(s):  
Protein Folding ◽  
Secondary Structure ◽  
Protein Function ◽  
Structure Prediction ◽  
Secondary Structure Prediction ◽  
Early Stage ◽  
Three Dimensional ◽  
Stage Structure ◽  
Dihedral Angles ◽  
Starting Point

AbstractThree-dimensional protein structure prediction is an important task in science at the intersection of biology, chemistry, and informatics, and it is crucial for determining the protein function. In the two-stage protein folding model, based on an early- and late-stage intermediates, we propose to use state-of-the-art secondary structure prediction servers for backbone dihedral angles prediction and devise an early-stage structure. Early-stage structures are used as a starting point for protein folding simulations, and any errors in this stage affect the final predictions. We have shown that modern secondary structure prediction servers could increase the accuracy of early-stage predictions compared to previously reported models.

Linear mixed model better than repeated measures analysis

2019 ◽  
Vol 30 (6) ◽  
pp. NP1-NP2 ◽  
Author(s):  
Işıl Kutluturk Karagoz ◽  
Berhan Keskin ◽  
Flora Özkalaycı ◽  
Ali Karagöz
Keyword(s):  
Mixed Models ◽  
Repeated Measures ◽  
Mixed Model ◽  
Linear Mixed Model ◽  
Linear Time ◽  
Case Series ◽  
Model Fit ◽  
Repeated Measures Analysis ◽  
Technical Issues ◽  
Better Than

We have some criticism regarding some technical issues. Mixed models have begun to play a pivotal role in statistical analyses and offer many advantages over more conventional analyses regarding repeated variance analyses. First, they allow to avoid conducting multiple t-tests; second, they can accommodate for within-patient correlation; third, they allow to incorporate not only a random coefficient, but also a random slope, typically ‘linear’ time in longitudinal case series when there are enough data and patients’ trajectories vary a lot and improving model fit.

Sign in / Sign up

Export Citation Format

Share Document