Results 61 to 70 of about 37,020 (188)
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
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search [PDF]
Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species.
Beller, Timo, Ohlebusch, Enno
core +2 more sources
Distributed enhanced suffix arrays [PDF]
Suffix arrays and trees are important and fundamental string data structures which lie at the foundation of many string algorithms, with important applications in computational biology, text processing, and information retrieval. Recent work enables the efficient parallel construction of suffix arrays and trees requiring at most O(n/p) memory per ...
Patrick Flick, Srinivas Aluru
openaire +1 more source
Integrating crop phenology and sclerotia germination models into SkleroPro improved Sclerotinia risk prediction accuracy from 34% to 66%, optimizing fungicide timing and supporting sustainable winter rapeseed production. Abstract BACKGROUND Sclerotinia stem rot, caused by Sclerotinia sclerotiorum, threatens winter rapeseed (Brassica napus) production ...
Vera Krause +4 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
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
Simple Algorithm to Maintain Dynamic Suffix Array for Text Indexes [PDF]
Dynamic suffix array is a suffix data structure that reflects various patterns in a mutable string. Dynamic suffix array is rather convenient for performing substring search queries over database indexes that are frequently modified.
Ajtkulov, P., Urbanovich, D.
core
Flexural performance of concrete‐filled steel tubular beams with wood chip aggregate
Abstract This study investigates the flexural performance of concrete‐filled steel tubular (CFST) beams with partial replacement of aggregates by wood chips (0%–25%) through experimental and numerical analysis. This study is novel in that it experimentally and numerically investigates the flexural behavior of CFST beams with partial replacement of ...
Mizan Ahmed +6 more
wiley +1 more source
Getting close-ish: A corpus based exploration of -ish as a marker of approximation and vagueness
This paper investigates the approximative nature of -ish, which takes its origin in de-adjectival adjectives in Middle English and from there spreads to -ish-derivatives from a wide array of bases, in terms of both categoriality and complexity.
Matthias Eitelmann, Dagmar Haumann
doaj +1 more source
Integrated methylome–transcriptome–microbiome analysis of AD skin identified thousands of DMRs. Rho GTPase signaling and actin–junctional programs emerged as central hubs integrating immune, epithelial, and microbial interactions in the pathogenesis of atopic dermatitis.
Tiina Skoog +22 more
wiley +1 more source

