Results 101 to 110 of about 40,875 (196)

SDSL-Mobile: Enabling space-efficient data structures for mobile applications

SoftwareX
This paper presents the process and results of porting the Succinct Data Structure Library 2.0 (SDSL-lite), a robust and well-established open-source C++11 library, to Android platforms.
Alexander Barquero, Anisha Wadhwani, Tyler Pencinger, Aaron Hong, Jaime Ruiz, Mattia Prosperi, Christina Boucher   +6 more
doaj   +1 more source

Endophytic Biostimulant Pyrroloquinoline Quinone Enhances Banana Growth and Primes Immunity Against Fusarium Wilt

Physiologia Plantarum, Volume 178, Issue 3, May/June 2026.
ABSTRACT Pyrroloquinoline quinone (PQQ) is a redox cofactor derived from prokaryotes that participates in various biological processes involving dehydrogenase enzymes. Previous field trials identified a PQQ‐producing endophyte, Burkholderia seminalis 869T2, which enhances banana growth and reduces Fusarium wilt incidence from 24.5% to 3.4%.
Shih‐Hsun Walter Hung, Man‐Yun Yu, Chia‐Ho Liu, Tsai‐Ching Huang, Jian‐Hau Peng, Nai‐Yun Jang, Chih‐Horng Kuo, Yu‐Liang Yang, Ying‐Ning Ho, En‐Pei Isabel Chiang, Hau‐Hsuan Hwang, Chieh‐Chen Huang   +11 more
wiley   +1 more source

Dictionary Matching with One Gap

, 2014
The dictionary matching with gaps problem is to preprocess a dictionary $D$ of $d$ gapped patterns $P_1,\ldots,P_d$ over alphabet $\Sigma$, where each gapped pattern $P_i$ is a sequence of subpatterns separated by bounded sequences of don't cares.
A. Amir, A. Amir, A. Amir, A. Amir, A.V. Aho, E. Ukkonen, E.M. McCreight, G. Kucherov, G. Myers, G. Myers, G. Navarro, G. Navarro, G.S. Brodal, J.C. Naa, K. Fredriksson, M. Morgante, M. Zhang, M.S. Rahman, P. Bille, T. Haapasalo   +19 more
core   +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

Grammar Compression With Support to Fast Substring Extraction

IEEE Access
We present a simple grammar-based compression strategy derived from the factorization used in the DC3 suffix-sorting algorithm that supports fast substring extraction. The input string is partitioned into non-overlapping substrings of fixed length $X$ ,
Danyelle S. O. Angelo, Daniel S. N. Nunes, Guilherme P. Telles, Felipe A. Louza   +3 more
doaj   +1 more source

ChromoTrace: Computational reconstruction of 3D chromosome configurations for super-resolution microscopy.

PLoS Computational Biology, 2018
The 3D structure of chromatin plays a key role in genome function, including gene expression, DNA replication, chromosome segregation, and DNA repair.
Carl Barton, Sandro Morganella, Øyvind Ødegård-Fougner, Stephanie Alexander, Jonas Ries, Tomas Fitzgerald, Jan Ellenberg, Ewan Birney   +7 more
doaj   +1 more source

Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees

Transactions of the Association for Computational Linguistics, 2021
Ehsan Shareghi, Matthias Petri, Gholamreza Haffari, Trevor Cohn   +3 more
doaj   +1 more source

The suffix tree of a tree and minimizing sequential transducers

Theoretical Computer Science, 1995
This paper gives a linear-time algorithm for the construction of the<br />suffix tree of a tree. The suffix tree of a tree is used to obtain an efficient<br />algorithm for the minimization of sequential transducers.
openaire   +3 more sources

DRIMust: a web server for discovering rank imbalanced motifs using suffix trees. [PDF]

Nucleic Acids Res, 2013
Leibovich L, Paz I, Yakhini Z, Mandel-Gutfreund Y.   +3 more
europepmc   +1 more source

Elucidating Transitions of <i>k</i>-mer-Based Objects Across <i>k</i>-mer Sizes. [PDF]

J Comput Biol
Park A, Koslicki D.
europepmc   +1 more source