Results 1 to 10 of about 735,070 (175)
Scalable Parallel Suffix Array Construction [PDF]
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in bioinformatics. We describe the first implementation and experimental evaluation of a scalable parallel algorithm for suffix array construction.
Kulla, F., Sanders, P.
openaire +4 more sources
Characterization of Graphs Without Even F $F$‐Orientations
ABSTRACT A graph G $G$ is 1‐extendable if every edge belongs to at least one 1‐factor of G $G$. Let G $G$ be a graph with a 1‐factor F $F$. Then an even (odd) F $F$ ‐orientation of G $G$ is an orientation in which each F $F$‐alternating cycle has exactly an even (odd) number of edges directed in the same fixed direction around the cycle.
Marién Abreu +3 more
wiley +1 more source
Approximate String Matching with Compressed Indexes
A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent explosion of interest on compressed
Pedro Morales +3 more
doaj +1 more source
Skip the alignment: degenerate, multiplex primer and probe design using K-mer matching instead of alignments. [PDF]
PriMux is a new software package for selecting multiplex compatible, degenerate primers and probes to detect diverse targets such as viruses. It requires no multiple sequence alignment, instead applying k-mer algorithms, hence it scales well for large ...
David A Hysom +5 more
doaj +1 more source
ABSTRACT Purpose Left ventricular (LV) strain is an early indicator of myocardial dysfunction. However, conventional strain metrics do not fully account for the multidirectional nature of myocardial deformation. The strain rate tensor, derived from velocity‐encoded MRI, represents the time‐resolved magnitude and direction of strain rate without the ...
Lasse Totland +7 more
wiley +1 more source
The new approach of multiple genome sequence matching based on GPU
Suffix trees and suffix arrays have been used widely in bioinformatics applications, especially for DNA sequence alignments in the initial exact match phase of heuristic algorithms.
DING Sha, ZHAO Shi-Yuan, LIN Tao
doaj
Direct construction of sparse suffix arrays with Libsais
Background Pattern matching is a fundamental challenge in bioinformatics, especially in the fields of genomics, transcriptomics and proteomics. Efficient indexing structures, such as suffix arrays, are critical for searching large datasets.
Simon Van de Vyver +4 more
doaj +1 more source
A Fast Algorithm for the Largest Area First Parsing of Real Strings
The largest area first parsing of a string often leads to the best results in grammar compression for a variety of input data. However, the fastest existing algorithm has Θ(N2 log N) time complexity, which makes it impractical for real-life ...
Ivan Katanic +2 more
doaj +1 more source
Smaller Compressed Suffix Arrays†
AbstractAn alternative to compressed suffix arrays is introduced, based on representing a sequence of integers using Fibonacci encodings, thereby reducing the space requirements of state-of-the-art implementations of the suffix array, while retaining the searching functionalities.
Ekaterina Benza +2 more
openaire +2 more sources
Online Rebate Strategy for a Dual‐Channel Supply Chain
ABSTRACT As online shopping channels become ubiquitous, consumers are faced with a vast number of digital purchasing options. To attract more consumers, many e‐shops utilize cashback websites (CWs) to provide online rebates. This study examines a dual‐channel supply chain, in which the manufacturer sells products through both its own online store and a
Peng Xu, Xuan Zhao, Tiaojun Xiao
wiley +1 more source

