Results 91 to 100 of about 735,070 (175)

Dispelling Myths and Misunderstandings About Defining and Remediating Dyslexia

Dyslexia, Volume 32, Issue 4, November 2026.
ABSTRACT Despite a strong base of scientifically supported research on dyslexia, pervasive misunderstandings continue, particularly in the United States, where state legislation, instructional practices and parent advocacy intersect in ways that influence how dyslexia is identified and treated.
Christy R. Austin, Marissa J. Filderman, Dana Raine, Rose Kjesbo, Courtney D. Boman   +4 more
wiley   +1 more source

TGMM: Large-scale Multilingual and Multi-Granularity Code Clone Detection Combining with Parse Tree and GPU [PDF]

Jisuanji gongcheng
This study proposes TGMM, a large-scale code clone detection method based on parse trees and Graphics Processing Unit (GPU) acceleration, to address the limitations of existing tools in multilingual adaptation and large-scale analysis. The method employs
YE Yuhang, REN Xiaoning, WU Yueming
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, Roman Martin Wittig, Cedric Girard‐Buttoz   +2 more
wiley   +1 more source

Simple Algorithm to Maintain Dynamic Suffix Array for Text Indexes [PDF]

, 2011
Dynamic suffix array is a suffix data structure that reflects various patterns in a mutable string. Dynamic suffix array is rather convenient for performing substring search queries over database indexes that are frequently modified.
Urbanovich, Dmitry, Urbanovich, D., Ajtkulov, P., Ajtkulov, Pavel   +3 more
core  

Better External Memory Suffix Array Construction

, 2005
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.
Sanders, Peter, Demetrescu, Camil, Kärkkäinen, Juha, Mehnert, Jens, Sedgewick, Robert, Tamassia, Roberto, Dementiev, Roman   +6 more
core   +1 more source

Speeding up tandem mass spectrometry-based database searching by longest common prefix

BMC Bioinformatics, 2010
Background Tandem mass spectrometry-based database searching has become an important technology for peptide and protein identification. One of the key challenges in database searching is the remarkable increase in computational demand, brought about by ...
Wang Le-Heng, Chi Hao, Zhou Chen, Li You, Wu Yan-Jie, Fu Yan, Sun Rui-Xiang, He Si-Min   +7 more
doaj   +1 more source

Two Self‐Stabilizing Algorithms for the Maximal Pentagon Partitioning Problem

Concurrency and Computation: Practice and Experience, Volume 38, Issue 19, October 2026.
ABSTRACT Given an undirected graph G=(V,E)$$ G=\left(V,E\right) $$, a collection of disjoint subsets of nodes π={V1,…,Vk}(V=V1∪⋯∪Vk)$$ \pi =\left\{{V}_1,\dots, {V}_k\right\}\kern0.3em \left(V={V}_1\cup \cdots \cup {V}_k\right) $$ is called a pentagon partition if each subset Vi(1≤i≤k)$$ {V}_i\kern0.3em \left(1\le i\le k\right) $$ satisfies one of the ...
Tota Yamada, Yonghwan Kim, Yoshiaki Katayama   +2 more
wiley   +1 more source

Kohdista: an efficient method to index and query possible Rmap alignments

Algorithms for Molecular Biology, 2019
Background Genome-wide optical maps are ordered high-resolution restriction maps that give the position of occurrence of restriction cut sites corresponding to one or more restriction enzymes. These genome-wide optical maps are assembled using an overlap-
Martin D. Muggli, Simon J. Puglisi, Christina Boucher   +2 more
doaj   +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, Cristina Ondei, Giovanni Righini   +2 more
wiley   +1 more source

Reconstructing a Suffix Array

, 2008
. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a suffix tree or suffix array should occur in lexicographical order (lexorder).
F. Franek, W. F. Smyth
core