Results 31 to 40 of about 14,465 (182)
Lyndon Array Construction during Burrows-Wheeler Inversion [PDF]
, 2017 In this paper we present an algorithm to compute the Lyndon array of a string $T$ of length $n$ as a byproduct of the inversion of the Burrows-Wheeler transform of $T$.
Louza, Felipe A. +3 more
core +3 more sources
Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX - NAACL '07, 2007 Suppose we have a large dictionary of strings. Each entry starts with a figure of merit (popularity). We wish to find the k-best matches for a substring, s, in a dictinoary, dict. That is, grep s dict | sort -n | head -k, but we would like to do this in sublinear time.
Kenneth Church +2 more
openaire +1 more source
Variable-order reference-free variant discovery with the Burrows-Wheeler Transform
BMC Bioinformatics, 2020 Background In [Prezza et al., AMB 2019], a new reference-free and alignment-free framework for the detection of SNPs was suggested and tested. The framework, based on the Burrows-Wheeler Transform (BWT), significantly improves sensitivity and precision ...
Nicola Prezza +3 more
doaj +1 more source
Compressed Representations of Permutations, and Applications [PDF]
, 2008 We explore various techniques to compress a permutation $\pi$ over n integers, taking advantage of ordered subsequences in $\pi$, while supporting its application $\pi$(i) and the application of its inverse $\pi^{-1}(i)$ in small time.
Barbay, Jérémy, Navarro, Gonzalo
core +7 more sources
Structator: fast index-based search for RNA sequence-structure patterns
BMC Bioinformatics, 2011 Background The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching databases for RNAs requires to match sequence-structure patterns. Unfortunately,
Will Sebastian +4 more
doaj +1 more source
New Algorithms for Position Heaps
, 2013 We present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and reduce the ...
A. Ehrenfeucht +7 more
core +1 more source
Cross-Document Pattern Matching [PDF]
, 2012 We study a new variant of the string matching problem called cross-document string matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a ...
A. Andersson +14 more
core +7 more sources
Counting Suffix Arrays and Strings
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schürmann, Klaus-Bernd, Stoye, Jens
openaire +3 more sources
Pest 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
Small, EarlyView.This review critically compares the electrochemical performance of carbon‐based and alloy‐type anodes for sodium‐ion batteries, with an emphasis on strategies that enhance practical deployment. It highlights how synergistic optimization of microstructure, electrolyte, and presodiation improves hard carbon, while nanostructuring and interfacial ...
Anele Tshaka +3 more
wiley +1 more source