Results 91 to 100 of about 40,875 (196)
Error Tree: A Tree Structure for Hamming & Edit Distances & Wildcards Matching
, 2015 Error Tree is a novel tree structure that is mainly oriented to solve the approximate pattern matching problems, Hamming and edit distances, as well as the wildcards matching problem.
Al-Okaily, Anas
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
BMC Bioinformatics, 2010 Background While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives when multiple alignments fail.
Grasseau Gilles +5 more
doaj +1 more source
Speeding up index construction with GPU for DNA data sequences [PDF]
, 2011 The advancement of technology in scientific community has produced terabytes of biological data.This datum includes DNA sequences.String matching algorithm which is traditionally used to match DNA sequences now takes much longer time to execute because ...
Abdul Rashid, Nur’aini +1 more
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
Structator: fast index-based search for RNA sequence-structure patterns
BMC Bioinformatics, 2011 Background The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching databases for RNAs requires to match sequence-structure patterns. Unfortunately,
Will Sebastian +4 more
doaj +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
Accurate long read mapping using enhanced suffix arrays [PDF]
, 2010 With the rise of high throughput sequencing, new programs have been developed for dealing with the alignment of a huge amount of short read data to reference genomes.
Dawyndt, Peter +4 more
core +1 more source
Efficient LZ78 factorization of grammar compressed text
, 2012 We present an efficient algorithm for computing the LZ78 factorization of a text, where the text is represented as a straight line program (SLP), which is a context free grammar in the Chomsky normal form that generates a single string.
A. Amir +19 more
core +1 more source
Austral Entomology, Volume 65, Issue 2, May 2026.ABSTRACT A morphology‐based MP analysis is undertaken to test the monophyly of the lined flat bark beetle genus Metaxyphloeus Thomas, 1984, as well as to hypothesize its intra‐ and intergeneric evolutionary relationships. Based on the results of the present work, Metaxyphloeus, as currently composed, is hypothesized as a monophyletic assemblage of ...
Matheus Bento
wiley +1 more source