An outbreak of Q fever occurred in February-April 2014 among workers at a waste-sorting plant in Bilbao (Spain). The outbreak affected 58.5% of investigated employees, 47.2% as confirmed cases (PCR and/or serology) and 11.3% as probable cases (symptoms without laboratory confirmation). Only employees who had no-access to the waste processing areas of the plant were not affected and incidence of...

In this paper we study the problem of sorting under forbidden comparisons where some pairs of elements may not be compared (forbidden pairs). Along with the set of elements V the input to our problem is a graph G(V,E), whose edges represents the pairs that we can compare in constant time. Given a graph with n vertices and m = ( n 2 ) − q edges we propose the first nontrivial deterministic algor...

We prove that sorting by reciprocal translocations can be done in O(n p log(n)) for an n-gene genome. Our algorithm is an adaptation of the Tannier et. al algorithm for sorting by reversals. This improves over the O(n) algorithm for sorting by reciprocal translocations given by Bergeron et al.

We prove that sorting by reciprocal translocations can be done in O(n3/2 √ log(n)) for an n-gene genome. Our algorithm is an adaptation of the algorithm of Tannier, Bergeron and Sagot for sorting by reversals. This improves over the O(n3) algorithm for sorting by reciprocal translocations given by Bergeron, Mixtacki and Stoye.

It is shown how sorting -numbers and lexicographic can be done completely within TEX. Lexicographic sorting allows words with ligatures and diacritical marks. As applications I selected sorting of address labels, and sorting and compressing i ndex . tex, Knuth's index reminders file. It is claimed that a set can be sorted within TEX once the ordering of the set is defined and encoded in a compa...

We give an approximation algorithm for the block sorting problem with an approximation ratio of 2 and run time O(n). The approximation algorithm is based on the related concept of block deletion. We show that finding an optimum block deletion sequence can be done in O(n) time, while block sorting is known to be NP-hard. Block sorting has importance in connection with optical character recogniti...