Abstract: Example embodiments relate to a method for processing reads of sequenced nucleic acid comprising: i) determining k-mers; ii) determining first counts indicative for the respective number of occurrences of the respective k-mers, and second counts indicative for the respective number of overlaps between respective k-mers; iii) determining a k-mer spectrum from the first counts; iv) determining first output counts indicative for the respective number of occurrences of the respective k-mers in the nucleic acid based on a position of the k-mers in the k-mer spectrum and based on a constraint. The constraint comprising: i) a first output count of a respective k-mer equals the total number of overlaps of the respective k-mer with other k-mers in the nucleic acid; and/or ii) a first output count of a respective k-mer equals the total number of overlaps of other k-mers with the respective k-mer.

Abstract: Multiple objects in a multi-tiered storage system are classified according to multiple metadata fields. Access histories of the classified objects are tracked. Tracked access histories for objects having given values for given metadata fields are amalgamated. Access probability distributions are determined for objects having given values for given metadata fields, based on the amalgamated access histories. Responsive to a new object being added to the system, the new object is classified according to multiple metadata fields. For each specific one of the multiple metadata fields according to which the new object is classified, the determined access probability distribution for objects having the same metadata classification value as the new object is retrieved. The predicted access probability distribution for the new object is determined, by combining the retrieved access probability distributions.

Abstract: Requests to access specific ones of a plurality of stored objects are processed by multiple access nodes. A separate access history is maintained for each access node. Each access history identifies stored objects most recently accessed through the specific node. A separate predicted access future is maintained for each stored object. A predicted access future associated with a specific stored object can be in the form of a listing of stored objects statistically predicted to be those most likely to be accessed within a given temporal proximity after the specific stored object is accessed. Each predicted access future is determined based on inversion of maintained access histories. Responsive to receiving an access request for a specific stored object, the predicted future associated with the requested object is read, a specific number of additional stored objects identified in the associated predicted future is pre-fetched from slower to faster storage.

Abstract: Multiple objects in a multi-tiered storage system are classified according to multiple metadata fields. Access histories of the classified objects are tracked. Tracked access histories for objects having given values for given metadata fields are amalgamated. Access probability distributions are determined for objects having given values for given metadata fields, based on the amalgamated access histories. Responsive to a new object being added to the system, the new object is classified according to multiple metadata fields. For each specific one of the multiple metadata fields according to which the new object is classified, the determined access probability distribution for objects having the same metadata classification value as the new object is retrieved. The predicted access probability distribution for the new object is determined, by combining the retrieved access probability distributions.

Abstract: Requests to access specific ones of a plurality of stored objects are processed by multiple access nodes. A separate access history is maintained for each access node. Each access history identifies stored objects most recently accessed through the specific node. A separate predicted access future is maintained for each stored object. A predicted access future associated with a specific stored object can be in the form of a listing of stored objects statistically predicted to be those most likely to be accessed within a given temporal proximity after the specific stored object is accessed. Each predicted access future is determined based on inversion of maintained access histories. Responsive to receiving an access request for a specific stored object, the predicted future associated with the requested object is read, a specific number of additional stored objects identified in the associated predicted future is pre-fetched from slower to faster storage.