Introduction: The objective of this study was to investigate the possible link between infl uenza (Flu) infection and Kawasaki disease (KD). Methods: We examined the medical records of 1,053 KD cases and 4,669 infl uenza infection cases hospitalized at our institute from January 1, 2011 to December 31, 2013. Cases of KD with concomitant infl uenza infection formed the KD + Flu group. Each KD + ...

Infection with SARS-CoV-2 virus is a serious challenge for the entire medical and scientific community. Medical institutions are facing record numbers of patients conflicting claims about due to its mutagenic properties, thanks D614G protein from Coronavirus (CoV) defining determines mutagenicity SARS - CoV MERS-CoV [1,2]. With expansion COVID-19 Pandemic, researchers have reported [3] clinical...

The kd-tree is a fundamental tool in computer science. Among other applications, the application of kd-tree search (by the tree method) to the fast evaluation of particle interactions and neighbor search is highly important, since the computational complexity of these problems is reduced from O(N2) for a brute force method to O(N log N) for the tree method, where N is the number of particles. I...

Prototype selection on the basis of conventional clustering algorithms results in good representation but is extremely time-taking on large data sets. kd-trees, on the other hand, are exceptionally efficient in terms of time and space requirements for large data sets, but fail to produce a reasonable representation in certain situations. We propose a new algorithm with speed comparable to the p...

LEDA and CGAL are platforms for combinatorial and geometric computing. We discuss the use of LEDA and CGAL for geometric computing and show that they provide a unique framework for exact, efficient and convenient geometric computing.

This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players must execute the protocol synchronously. Thus, the protocol cannot be executed on asynchronous networks such as the Internet. We show that the...

BACKGROUND Descriptive epidemiologic studies of recurrent and non-recurrent Kawasaki disease (KD) may identify other potentially important differences between these illnesses. METHODS Data from the USA and Japan, the Centers for Disease Control and Prevention (CDC) national KD surveillance(1984-2008) and the 17th Japanese nationwide survey (2001-2002), respectively, were analyzed to examine r...

Molecular recognition by intrinsically disordered proteins (IDPs) plays a central role in many critical cellular processes. Toward achieving detailed mechanistic understanding of IDP-target interactions, here we employ the "Hamiltonian mapping" methodology, which is rooted in the weighted histogram analysis method (WHAM), for the fast and efficient calibration of structure-based models in studi...

We present an efficient pruning algorithm for selecting candidate short-range interaction pairs in particle-based discretization methods such as the discrete element method or smoothed particle hydrodynamics. Geometrically, our technique is based on a recursive bisection of space, forming a particular type of kd-tree. But instead of relying on a tree data structure, our algorithm traverses an i...

Organisms must have efficient mechanisms of DNA repair and recombination to prevent alterations in their genetic information due to DNA damage. There is evidence for DNA repair and recombination in plastids of higher plants, although very little is known at the biochemical level. Many chloroplast proteins are of eubacterial ancestry, suggesting that the same could be true for the components of ...