Results 61 to 70 of about 735,070 (175)

Fast Lightweight Suffix Array Construction and Checking

open access: yes, 2003
We describe an algorithm that, for any $v\in[2,n]$, constructs the suffix array of a string of length $n$ in $\Oh{vn + n \log n}$ time using $\Oh{v+n/\sqrt{v}}$ space in addition to the input (the string) and the output (the suffix array). By setting $v=\
Juha Kärkkäinen   +3 more
core   +2 more sources

Suffix sorting via matching statistics

open access: yesAlgorithms for Molecular Biology
We introduce a new algorithm for constructing the generalized suffix array of a collection of highly similar strings. As a first step, we construct a compressed representation of the matching statistics of the collection with respect to a reference ...
Zsuzsanna Lipták   +2 more
doaj   +1 more source

Getting close-ish: A corpus based exploration of -ish as a marker of approximation and vagueness

open access: yesZeitschrift für Wortbildung, 2023
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

Advancing Sclerotinia risk forecasting for winter rapeseed in Germany: integrating crop phenology and disease development into a decision support system

open access: yesPest Management Science, EarlyView.
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

Data structures of genome and protein sequences indexing

open access: yesIranian Journal of Information Processing & Management, 2016
Data structure is a tool for storage and retrieval of information which is named logic and mathematic way of specific data organization. various sequences of genes and proteins in various creatures increases the amount of data in genome databases, and ...
Adeleh asadi
doaj  

Proximity Proteomics Maps Candidate Cellular Uptake Pathways for Cell‐Derived Nanovesicles

open access: yesSmall Methods, EarlyView.
TurboID‐based dual‐sided proteomics compares mechanically generated cell‐derived nanovesicles with naturally secreted small extracellular vesicles. Vesicle proteomes define candidate interaction signatures, while recipient‐cell proximity labelling identifies exposure‐associated proteins.
Eisuke Kanao   +8 more
wiley   +1 more source

An OTA Upgrade Differential Compression Algorithm Based on Suffix Array Induced Sorting and BsDiff Methods

open access: yesApplied Sciences
As the scale and complexity of software for industrial equipment increases, the risk of defects being introduced into the software also increases.
Xinrong Zhang   +5 more
doaj   +1 more source

Discovery of regulatory elements is improved by a discriminatory approach. [PDF]

open access: yesPLoS Computational Biology, 2009
A major goal in post-genome biology is the complete mapping of the gene regulatory networks for every organism. Identification of regulatory elements is a prerequisite for realizing this ambitious goal.
Eivind Valen   +3 more
doaj   +1 more source

Receptive Meaning‐Recall Knowledge of Derivational Morphology Among EFL Learners: A Case for L1‐Population‐Specific Assessment

open access: yesTESOL Quarterly, EarlyView.
Abstract Vocabulary knowledge plays a crucial role in L2 proficiency, significantly impacting learners' reading comprehension. Although extensive research has explored whether knowledge of base words extends to recognition of derivational forms, results are inconsistent, especially among learners from non‐Indo‐European linguistic backgrounds.
Mastoor Al‐Kaboody   +5 more
wiley   +1 more source

Algorithms for enhanced suffix array

open access: yes, 2009
Suffix tree is one of the most important data structures in string processing. However, the space consumption of the suffix tree is a bottleneck in large scale applications. Suffix array is by contrast a space efficient data structure having not so large
Šedek, Jindřich
core   +1 more source

Home - About - Disclaimer - Privacy