Results 31 to 40 of about 1,556 (153)
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 Ward Church +2 more
openaire +2 more sources
Efficient computation of absent words in genomic sequences
BMC Bioinformatics, 2008 Background Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon usage, and so on.
Herold Julia +2 more
doaj +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
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
Utterance evolution: the road to generative, combinatorial communicators
Biological Reviews, EarlyView.ABSTRACT Language has long been considered uniquely complex in the animal kingdom; however, animal research over the last decade has begun to challenge some long‐standing premises about exactly which language capacities are uniquely human. The task of resolving why and how complex communication systems evolve, particularly human language, has ...
Catherine Crockford +2 more
wiley +1 more source
ENERGY &ENVIRONMENTAL MATERIALS, EarlyView.This study develops hydroxylated MXene‐supported ultrafine cobalt hexacyanocobaltate anodes through interfacial engineering, achieving enhanced conductivity, structural stability, and superior potassium‐ion storage performance. Cobalt‐based Prussian blue analogs (CoHCC) have emerged as highly promising anode materials for potassium‐ion batteries due to
Anni Chen +6 more
wiley +1 more source
Smaller Compressed Suffix Arrays†
The Computer Journal, 2020 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 +1 more source
Online Rebate Strategy for a Dual‐Channel Supply Chain
Naval Research Logistics (NRL), EarlyView.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
A Branch‐and‐Price Algorithm for the Symmetric Electric Traveling Salesman Problem
Networks, EarlyView.ABSTRACT The Electric Traveling Salesman Problem (ETSP) is a variant of the well‐known TSP in which an electric vehicle must visit a set of customers minimizing the total cost of its route. The vehicle is assumed to be equipped with a battery of limited capacity that may need to be recharged along the route.
Alberto Ceselli +2 more
wiley +1 more source
Scalable Parallel Suffix Array Construction [PDF]
Parallel Computing, 2006 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 +3 more sources