Results 101 to 110 of about 58,956 (207)
Dynamic dictionary matching and compressed suffix trees [PDF]
, 2005 Recent breakthrough in compressed indexing data structures has reduced the space for indexing a text (or a collection of texts) of length n from O(n log n) bits to O(n) bits, while allowing very efficient pattern matching.
Chan, HL, Hon, WK, Lam, TW, Sadakane, K
core +1 more source
Efficient Dynamic Dictionary Matching with DAWGs and AC-automata
, 2019 The dictionary matching is a task to find all occurrences of patterns in a set $D$ (called a dictionary) on a text $T$. The Aho-Corasick-automaton (AC-automaton) is a data structure which enables us to solve the dictionary matching problem in $O(d\log ...
Hendrian, Diptarama +3 more
core +1 more source
Minor epic: Notes toward a different “Anthropoetry”
Anthropology and Humanism, Volume 51, Issue 1, June 2026.Abstract Anthropologists have often turned to poetry as a means of accessing emotional registers of which conventional academic prose is unable to avail. In doing so, they have tacitly conflated poetry with lyric poetry, today probably the most widely practiced poetic genre, associated in particular with the expression of inner feelings and subjectival
Stuart McLean
wiley +1 more source
Converting suffix trees into factor/suffix oracles
Journal of Discrete Algorithms, 2008 Several methods to compress suffix trees were defined, most of them with the aim of obtaining compact (that is, space economical) index structures. Besides this practical aspect, a compression method can reveal structural properties of the resulting data structure, allowing a better understanding of it and a better estimation of its performances.
openaire +3 more sources
Language Learning, Volume 76, Issue 2, Page 494-527, June 2026.Abstract We investigate what is learned from exposure to usage in verbal morphology using an error correction mechanism within an associative learning framework. We computationally simulated how second language (L2) learners would respond to naturalistic input of aspectual usage, characterized by “imperfect contingencies,” given two types of ...
Justyna Mackiewicz +2 more
wiley +1 more source
Measuring Contribution of HTML Features in Web Document Clustering
CLEI Electronic Journal, 2008 Documents in HTML format have many features to analyze, from the terms in special sections to the phrases that appear in the whole document. However, it is important to decide which feature contributes the most to separate documents according to classes.
Esteban Meneses +1 more
doaj +1 more source
Computer Aided Simulation of DNA Fingerprint Amplified Fragment Length Polymophism (AFLP) Using Suffix Tree Indexing and Data Mining [PDF]
, 2011 AFLP is one of the DNA Fingerprinting techniques which have broad application as genetic marker in various fields. Begin with the DNA sequence digestion using one or more particular restriction enzyme, ligation of the adapters to the overhanging sticky ...
Budiman, Agung +3 more
core
Earthquake Spectra, Volume 42, Issue 2, May 2026.We perform linear mixed‐effects analyses with a ground‐motion dataset to evaluate how well ground‐motion models (GMMs) fit active crustal, subduction interface, and subduction intraslab earthquakes in Puerto Rico and the US Virgin Islands. Most of the GMMs reproduce the spatial variation in peak ground motions with earthquake magnitude and rupture ...
Brad T. Aagaard +2 more
wiley +1 more source
High Performance Implementation of Planted Motif Problem using Suffix trees [PDF]
In this paper we present a high performance implementation of suffix tree based solution to the planted motif problem on two different parallel architectures: NVIDIA GPU and Intel Multicore machines.
core
Mind the Gap: Linking Refactorings and Code Smells in Elixir
Journal of Software: Evolution and Process, Volume 38, Issue 5, May 2026.ABSTRACT Elixir is a functional programming language increasingly used in the industry to develop scalable and fault‐tolerant concurrent systems more easily and with fewer computational resources. In previous studies, we cataloged 35 code smells and 82 refactorings tailored for this language, validating them with over 300 experienced developers ...
Lucas Vegi, Marco Túlio Valente
wiley +1 more source