Results 61 to 70 of about 1,556 (153)
Rust resistance in barley accessions County and BHS248
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
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]
Kempa D, Kociumaka T.
europepmc +1 more source
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
Using Suffix Arrays to Compute Term Frequency and Document Frequency for All Substrings in a Corpus
Mikio Yamamoto, Kenneth W. Church
doaj +1 more source
Compressed Suffix Arrays for Massive Data [PDF]
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
Bitpacking techniques for indexing genomes: II. Enhanced suffix arrays. [PDF]
Wu TD.
europepmc +1 more source
Inexact Local Alignment Search over Suffix Arrays. [PDF]
Ghodsi M, Pop M.
europepmc +1 more source
Suffix arrays in theory and practice.
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

