libglobus-gridmap-callout-error0t64

Grid Community Toolkit - Globus Gridmap Callout Errors

The Grid Community Toolkit (GCT) is an open source software toolkit used for building grid systems and applications. It is a fork of the Globus Toolkit originally created by the Globus Alliance. It is supported by the Grid Community Forum (GridCF) that provides community-based support for core software packages in grid computing.

libglobus-gsi-callback0t64

Grid Community Toolkit - Globus GSI Callback Library

The Grid Community Toolkit (GCT) is an open source software toolkit used for building grid systems and applications. It is a fork of the Globus Toolkit originally created by the Globus Alliance. It is supported by the Grid Community Forum (GridCF) that provides community-based support for core software packages in grid computing.

python3-pygments-ansi-color

ANSI color-code highlighting lexer for Pygments (Python 3)

pygments-ansi-color you can highlight your content with Pygments' regular API. The magic is happen due using the dedicated ANSI lexer and formatter provided by the module.

liblomiri-action-qt1

Lomiri Action Qt5 API

Lomiri Common Action API (built against Qt5). Allow applications to export actions in various forms to the Lomiri Shell.

papers

Document (PostScript, PDF) viewer

Papers is a simple multi-page document viewer. It can display and print Comic Books archives (CBR, CBT, CBZ, CB7), DjVu, Portable Document Format (PDF) and TIFF files. When supported by the document, it also allows searching for text, copying text to the clipboard, hypertext navigation, and table-of-contents bookmarks.

libwfa2-0

exact gap-affine algorithm (shared library)

The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage of homologous regions between the sequences to accelerate the alignment process. Unlike to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O(ns+s^2), proportional to the sequence length n and the alignment score s, using O(s^2) memory (or O(s) using the ultralow/BiWFA mode). Moreover, the WFA algorithm exhibits simple computational patterns that the modern compilers can automatically vectorize for different architectures without adapting the code. To intuitively illustrate why the WFA algorithm is so interesting, look at the following figure. The left panel shows the cells computed by a classical dynamic programming based algorithm (like Smith-Waterman or Needleman Wunsch). In contrast, the right panel shows the cells computed by the WFA algorithm to obtain the same result (i.e., the optimal alignment).