Shark meat is consumed as a food source worldwide, especially in Asian countries. However, since sharks are apex predators in the ocean food chain, they are prone to bioaccumulation of heavy metals. More than 100 million sharks are caught annually for human consumption, and the safety of shark meat cannot be overemphasized. Here, we examined heavy metal concentration in the muscle tissue of 6 shark species including 3 migratory species (Carcharhinus brachyurus, Carcharhinus obscurus, and Isurus oxyrinchus) and 3 local species (Triakis scyllium, Mustelus manazo, and Cephaloscyllium umbratile) from fish markets in Jeju Island, Republic of Korea. The concentrations of 11 heavy metals (Cr, Fe, Cu, Zn, As, Se, Cd, Sn, Sb, Pb, and Hg) and MeHg were analyzed. The result showed that the average concentrations of all metals, except for that of As, were below the regulatory maximum limits of many organizations, including the Codex standard. Hg and MeHg were significantly correlated with body length, body weight, and age, and the concentration of Hg was expected to exceed the limit in C. brachyurus with a body length or weight of over 130 cm or 25 kg, respectively. Our results indicate that shark meat can expose consumers to a high level of As and that copper sharks bigger than the predicted size should be avoided for excessive Hg. Considering these findings, a detailed guideline on consumption of meat of different shark species should be suggested based on further investigation.

Many applications, such as protein design, homology modeling, flexible docking, etc. require the prediction of a protein's optimal side-chain conformations from just its amino acid sequence and backbone structure. Side-chain prediction (SCP) is an NP-hard energy minimization problem. Here, we present BetaSCPWeb which efficiently computes a conformation close to optimal using a geometry-prioritization method based on the Voronoi diagram of spherical atoms. Its outputs are visual, textual and PDB file format. The web server is free and open to all users at http://voronoi.hanyang.ac.kr/betascpweb with no login requirement.

No abstract

Voronoi diagrams are powerful for understanding spatial properties. However, few reports have been made for moving generators despite their important applications. We present a topology-oriented event-increment (TOI-E) algorithm for constructing a Voronoi diagram of moving circular disks in the plane over the time horizon [0,t ∞ ). The proposed TOI-E algorithm computes the event history of the Voronoi diagram over the entire time horizon in O(k F log n + k C n log n) time with O(n log n) preprocessing time and O(n + k F + k C ) memory for n disk generators, k F edge flips, and k C disk collisions during the time horizon. Given an event history, the Voronoi diagram of an arbitrary moment t * < t ∞ can be constructed in O(k * + n) time where k * represents the number of events in [0,t * ). An example of the collision avoidance problem among moving disks is given by predicting future conjunctions among the disks using the proposed algorithm. Dynamic Voronoi diagrams will be very useful as a platform for the planning and management of the traffics of unmanned vehicles such as cars on street, vessels on surface, drones and airplanes in air, and satellites in geospace.

No abstract