CRISPR gene editing holds great promise to modify DNA sequences in somatic cells to
treat disease. However, standard computational and biochemical methods to predict off-target …

Sparse data computations are ubiquitous in science and engineering. Unlike their dense
data counterparts, sparse data computations have less locality and more irregularity in their …

Finding the shortest paths from a single source to all other vertices is a common problem in
graph analysis. The Bellman-Ford's algorithm is the solution that solves such a single-source …

Motivation Clustered regularly interspaced short palindromic repeats (CRISPR) technologies
allow for facile genomic modification in a site-specific manner. A key step in this process is …

Biological applications, from genomics to ecology, deal with graphs that represents the
structure of interactions. Analyzing such data requires searching for subgraphs in collections of …

HIFSuite ia a set of tools and application programming interfaces (APIs) that provide support
for modeling and verification of HW/SW systems. The core of HIFSuite is the HDL …

Breadth-first search (BFS) is one of the most common graph traversal algorithms and the
building block for a wide range of graph applications. With the advent of graphics processing …

Mutation analysis is a widely-adopted strategy in software testing with two main purposes:
measuring the quality of test suites, and identifying redundant code in programs. Similar …

Human pose estimation (HPE) through deep learning-based software applications is a
trend topic for markerless motion analysis. Thanks to the accuracy of the state-of-the-art …

Transaction-level modeling (TLM) is the most promising technique to deal with the
increasing complexity of modern embedded systems. However, modeling a complex system …