No abstract

Chewing side preference is a factor that could effect prosthodontic treatment. The purpose of this study was to determine whether chewing side was another type of hemispheric lateralization comparable with footedness, handedness, eyedness and earedness. Chewing side preference was tested in 189 subjects of whom 84 were partially edentulous, 98 had a full compliment of dental units (81 included implant-supported restoration restoring the missing teeth and 17 with fully intact dentitions), and seven were fully edentulous, restored with complete dentures. Laterality tests were carried out for the first cycle of mastication, handedness, footedness, earedness and eyedness and patient questionnaire. Most patients preferred chewing on the right side (78b3%) and were right sided. Chewing side preference correlated with other tested hemispherical lateralities. Missing teeth, occlusion type, lateral guidance, gender, implant-supported restorations and complete dentures do not affect the side preference for chewing. This presents a strong argument that chewing side preference is centrally controlled and provides food for thought regarding its significance in prosthodontics.

Comparisons of the protein sequences and gene structures of the known creatine kinase isoenzymes and other guanidino kinases revealed high homology and were used to determine the evolutionary relationships of the various guanidino kinases. A 'CK framework' is defined, consisting of the most conserved sequence blocks, and 'diagnostic boxes' are identified which are characteristic for anyone creatine kinase isoenzyme (e.g. for vertebrate B-CK) and which may serve to distinguish this isoenzyme from all others (e.g. from M-CKs and Mi-CKs). Comparison of the guanidino kinases by near-UV and far-UV circular dichroism further indicates pronounced conservation of secondary structure as well as of aromatic amino acids that are involved in catalysis.

The weighted tree augmentation problem (WTAP) is a fundamental network design problem. We are given an undirected tree G = (V, E) with n = |V | nodes, an additional set of edges L called links and a cost vector c ∈ R L ≥1 . The goal is to choose a minimum cost subset S ⊆ L such that G = (V, E ∪ S) is 2-edgeconnected. In the unweighted case, that is, when we have c = 1 for all ∈ L, the problem is called the tree augmentation problem (TAP).Both problems are known to be APX-hard, and the best known approximation factors are 2 for WTAP by (Frederickson and JáJá, '81) and 3 2 for TAP due to (Kortsarz and Nutov, TALG '16). Adjashvili (SODA '17) recently presented an ≈ 1.96418 + ε-approximation algorithm for WTAP for the case where all link costs are bounded by a constant. This is the first approximation with a better guarantee than 2 that does not require restrictions on the structure of the tree or the links.In this paper, we improve Adjiashvili's approximation to a 3 2 + ε-approximation for WTAP under the bounded cost assumption. We achieve this by introducing a strong LP that combines 0, 1 2 -Chvátal-Gomory cuts for the standard LP for the problem with bundle constraints from Adjiashvili. We show that our LP can be solved efficiently and that it is exact for some instances that arise at the core of Adjiashvili's approach. This results in the improved performance * Martin Groß, Jochen Könemann and Laura Sanità acknowledge support from the NSERC Discovery Grant Program as well as an Early Researcher Award by the Province of Ontario. Samuel Fiorini acknowledges support from F.R.S. -FNRS (grant number 1861993, "Polyhedral combinatorics: cycle transversals, {0, 1/2}-cuts") and the ERC (Consolidator Grant 615640-ForEFront). +ε, which is asymptotically on par with the result by Kortsarz and Nutov. Our result also is the best-known LP-relative approximation algorithm for TAP.

No abstract