Results 71 to 80 of about 301,848 (186)
Document retrieval from suffix arrays on disk
, 2005 The research papers about suffix arrays have grown many, and asymptotically better algorithms are being developed. There are, however, two areas that seem to have been a little forgotten - searching in external memory and document retrieval from a suffix
Falkenberg, Hans Christian
core +1 more source
Index structures for distributed text databases
Journal of Computer Science and Technology, 2004 The Web has became an obiquitous resource for distributed computing making it relevant to investigate new ways of providing efficient access to services available at dedicated sites.
Juan Mauricio Marin Cahiuan
doaj
Construction of distributed suffix trees
Технічна інженеріяThe paper addresses the problem of parallel suffix tree construction over large text arrays without the use of cluster infrastructure. The evolution of relevant algorithms is analysed – from the single-threaded methods of Weiner, McCreight, and Ukkonen ...
D.V. Zvazhii, O.M. Malii
doaj +1 more source
Utterance evolution: the road to generative, combinatorial communicators
Biological Reviews, Volume 101, Issue 5, Page 2427-2447, October 2026.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
A Branch‐and‐Price Algorithm for the Symmetric Electric Traveling Salesman Problem
Networks, Volume 88, Issue 3, Page 354-368, October 2026.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
Computing Suffix Links for Suffix Trees and Arrays
, 2005 We present a new and simple algorithm to reconstruct suffix links in suffix trees and suffix arrays. The algorithm is based on observations regarding suffix tree construction algorithms.
Moritz G. Maaß
core
Distributed query processing using suffix arrays
, 2003 . Suffix arrays are more efficient than inverted files for solving complex queries in a number of applications related to text databases. Examples arise when dealing with biological or musical data or with texts written in oriental languages, and when ...
Gonzalo Navarro, Mauricio Marín
core +1 more source
Suffix trees and suffix arrays in primary and secondary storage [PDF]
, 2007 In recent years the volume of string data has increased exponentially, and the speed at which these data is being generated has also increased. Some examples of string data includes biological sequences, internet webpages, and digitalized documents, to ...
Ko, Pang
core +1 more source
Expert Systems, Volume 43, Issue 10, October 2026.ABSTRACT This study presents a comprehensive methodology for processing multilingual customer support data to prepare it for training AI‐based conversational systems. Using a dataset of 36,599 unique customer interactions from a Finnish energy company, we employed language‐specific BERT models to identify and analyse thematic patterns within customer ...
Joona Mäntyvaara +2 more
wiley +1 more source
Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees. [PDF]
Proc Annu ACM SIAM Symp Discret Algorithms, 2023 Kempa D, Kociumaka T.
europepmc +1 more source