Results 61 to 70 of about 1,556 (153)

Rust resistance in barley accessions County and BHS248

open access: yesCrop Science, Volume 66, Issue 4, July/August 2026.
Abstract Rusts can cause devastating losses of barley (Hordeum vulgare L.) in epidemic years. Several reactions to Puccinia hordei (Rph) genes/quantitative trait loci (QTLs) for resistance to barley leaf rust (BLR) have been documented. In contrast, there is a dearth of characterized resistance sources against stem rust (SR) caused by Puccinia graminis.
Kelly Jordaan   +7 more
wiley   +1 more source

Construction of distributed suffix trees

open access: yesТехнічна інженерія
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

Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees. [PDF]

open access: yesProc Annu ACM SIAM Symp Discret Algorithms, 2023
Kempa D, Kociumaka T.
europepmc   +1 more source

Análisis de algoritmos para la construcción de arreglo de sufijos en tiempo lineal Algorithms analysis for construction of suffix arrays in linear timel

open access: yesRevista Ingenierías Universidad de Medellín, 2010
El avance en la investigación de los arreglos de sufijos permitió en el año 2003 el planteamiento de tres algoritmos de tiempo lineal para la generación de tales estructuras.
César Alejandro Arango Palacio   +1 more
doaj  

Compressed Suffix Arrays for Massive Data [PDF]

open access: yes, 2009
We present a fast space-efficient algorithm for constructing compressed suffix arrays (CSA). The algorithm requires O (n logn ) time in the worst case, and only O (n ) bits of extra space in addition to the CSA. As the basic step, we describe an algorithm for merging two CSAs.
openaire   +1 more source

Inexact Local Alignment Search over Suffix Arrays. [PDF]

open access: yesProceedings (IEEE Int Conf Bioinformatics Biomed), 2009
Ghodsi M, Pop M.
europepmc   +1 more source

Faster run-length compressed suffix arrays. [PDF]

open access: yesOasics
Brown NK   +4 more
europepmc   +1 more source

Suffix arrays in theory and practice.

open access: yes, 2007
The suffix array of a string is a permutation of all starting positions of the string's suffixes in lexicographical order. In this thesis, we investigate mathematical and algorithmical aspects of suffix arrays. The first part mainly deals with combinatorial properties of suffix arrays and their enumeration.
openaire   +2 more sources

Home - About - Disclaimer - Privacy