Results 31 to 40 of about 44,211 (221)

One-variable word equations in linear time [PDF]

open access: yes, 2013
In this paper we consider word equations with one variable (and arbitrary many appearances of it). A recent technique of recompression, which is applicable to general word equations, is shown to be suitable also in this case.
A. Jeż   +14 more
core   +1 more source

Evolutionary radiation of large‐bodied gorgonopsians from the lower Abrahamskraal formation of South Africa

open access: yesThe Anatomical Record, EarlyView.
Abstract The middle Permian represents a critical interval in therapsid evolution, when gorgonopsians emerged as some of the first specialized apex predators within terrestrial ecosystems. Despite their significance, the early diversification of Gorgonopsia in Gondwana remains poorly understood due to scarcity and fragmentary material.
Zanildo Macungo   +5 more
wiley   +1 more source

On-line construction of position heaps [PDF]

open access: yes, 2011
We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it considers the ...
A. Blumer   +10 more
core   +8 more sources

Utterance evolution: the road to generative, combinatorial communicators

open access: yesBiological 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

Dictionary Matching with One Gap

open access: yes, 2014
The dictionary matching with gaps problem is to preprocess a dictionary $D$ of $d$ gapped patterns $P_1,\ldots,P_d$ over alphabet $\Sigma$, where each gapped pattern $P_i$ is a sequence of subpatterns separated by bounded sequences of don't cares.
A. Amir   +19 more
core   +1 more source

Elaborating the Motivations and Attitudes Driving Interest in Voluntary Biodiversity Credits

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT Global biodiversity loss has prompted the search for new sources of conservation finance, such as voluntary biodiversity credits (VBCs). However, despite optimistic market projections, current uptake of VBCs is limited. Adopting an interpretive approach, we analyse 21 semistructured interviews with early market actors (buyers, sellers ...
Gamze Yakar‐Pritchard   +5 more
wiley   +1 more source

A framework for space-efficient string kernels

open access: yes, 2015
String kernels are typically used to compare genome-scale sequences whose length makes alignment impractical, yet their computation is based on data structures that are either space-inefficient, or incur large slowdowns.
A Apostolico   +13 more
core   +1 more source

Composite repetition-aware data structures [PDF]

open access: yes, 2015
In highly repetitive strings, like collections of genomes from the same species, distinct measures of repetition all grow sublinearly in the length of the text, and indexes targeted to such strings typically depend only on one of these measures.
A Blumer   +16 more
core   +2 more sources

Pulmonalis or Pulmonaris? It's Elementarius, My Dear Watson

open access: yesClinical Anatomy, EarlyView.
ABSTRACT The adjectival suffix ‐alis and its allomorph ‐aris are very common in the anatomical nomenclature; however, rules governing differential usage, such as ‐aris substituting for ‐alis following an ‐l‐, leave many exceptions. Here, we report an empirical study of 985 adjectives with ‐alis and ‐aris suffixes used in Terminologia Anatomica (2nd ed.)
Paul E. Neumann   +3 more
wiley   +1 more source

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing

open access: yes, 2013
This paper presents a general technique for optimally transforming any dynamic data structure that operates on atomic and indivisible keys by constant-time comparisons, into a data structure that handles unbounded-length keys whose comparison cost is not
Amir, Amihood   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy