Results 51 to 60 of about 679,088 (213)
Journal of the Royal Anthropological Institute, EarlyView.Anthropologists have long shown that asking for food in times of need is morally valued in rural Namibia. Yet among the Damara pastoralists with whom I work, people now increasingly describe feeling shame (taob) when they ask for food. In this article, I trace this shift to the affective dynamics of social class formation.
Michael Schnegg
wiley +1 more source
A New Algorithm for Sparse Suffix Trees
, 2011 International audienceThe sparse suffix trees are suffix trees in which some suffixes are omitted. There are many applications for these structures, ranging from bioinformatics to natural language processing.
Sacomoto, Gustavo Akio Tominaga +1 more
core +4 more sources
Fast parallel construction of variable-length Markov chains
BMC Bioinformatics, 2021 Background Alignment-free methods are a popular approach for comparing biological sequences, including complete genomes. The methods range from probability distributions of sequence composition to first and higher-order Markov chains, where a k-th order ...
Joel Gustafsson +3 more
doaj +1 more source
Loanwords and Linguistic Phylogenetics: *pelek̑u‐ ‘axe’ and *(H)a(i̯)g̑‐ ‘goat’1
Transactions of the Philological Society, Volume 123, Issue 1, Page 116-136, March 2025.Abstract This paper assesses the role of borrowings in two different approaches to linguistic phylogenetics: Traditional qualitative analyses of lexemes, and quantitative computational analysis of cognacy. It problematises the assumption that loanwords can be excluded altogether from datasets of lexical cognacy.
Simon Poulsen
wiley +1 more source
Fast index based algorithms and software for matching position specific scoring matrices [PDF]
, 2006 Beckstette M, Homann R, Giegerich R, Kurtz S. Fast index based algorithms and software for matching position specific scoring matrices. BMC Bioinformatics.
Kurtz Stefan +11 more
core +1 more source
RD-GST: online method for constructing distributed generalized suffix trees
Технічна інженеріяGeneralized suffix trees (GST) are fundamental data structures for exact substring search with linear time complexity with respect to query length , regardless of the size of the indexed corpus.
I.S. Sadovyi, V.V. Vorotnikov
doaj +1 more source
Efficient heuristics for the Steiner forest problem
International Transactions in Operational Research, EarlyView.Abstract Let G=(V,E)$G = (V, E)$ be a connected undirected graph, V$V$ a set of nodes, E$E$ a set of edges, |V|=n$|V| = n$, and |E|=m$|E| = m$. Given a non‐negative weight function w:E→R+$w: E \rightarrow \mathbb {R}^+$ associated with its edges, a set τ={Ti⊆V|i=1,…,p}$\tau = \lbrace T_i \subseteq V | i = 1, \ldots, p\rbrace$ of terminal sets Ti$T_i ...
Murilo Stockinger +4 more
wiley +1 more source
Yearbook of Balkan and Baltic StudiesThe study of alien species has become more and more relevant today. In particular, the influence of alien species on the local nature is studied, but more and more studies have also begun to appear on how alien species affect the local language and ...
Jüri Viikberg +2 more
doaj +1 more source
Approximate String Matching with Compressed Indexes
Algorithms, 2009 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
Journal of Phycology, EarlyView.Abstract Mallomonas is among the most diverse genera of Chrysophyceae, yet many of its lineages remain taxonomically unresolved due to limited molecular sampling. Mallomonas series Peronoides, historically limited to four species, has posed persistent taxonomic difficulties, most notably the long‐standing and problematic reliance on a rare ...
Petr Knotek +3 more
wiley +1 more source