Results 31 to 40 of about 4,379 (204)
CGAP-align: a high performance DNA short read alignment tool. [PDF]
Next generation sequencing platforms have greatly reduced sequencing costs, leading to the production of unprecedented amounts of sequence data. BWA is one of the most popular alignment tools due to its relatively high accuracy.
Yaoliang Chen +7 more
doaj +1 more source
Sampling the Suffix Array with Minimizers [PDF]
Sampling (evenly) the suffixes from the suffix array is an old idea trading the pattern search time for reduced index space. A few years ago Claude et al. showed an alphabet sampling scheme allowing for more efficient pattern searches compared to the sparse suffix array, for long enough patterns.
Szymon Grabowski, Marcin Raniszewski
openaire +2 more sources
Analisi sperimentale delle prestazioni di un suffix tree troncato [PDF]
Le strutture dati sono un ambito di ricerca estremamente vivo, poiché adatte a risolvere un ampio numero di problemi d'indicizzazione. Tra le varie strutture dati, particolare rilevanza hanno le strutture dati basate sui suffissi, che si prestano ...
Zucchetto, Daniel
core
In order to achieve content-based binocular stereoscopic image or video retrieval efficiently, a feature indexing algorithm based on hybrid grid multiple suffix tree and hierarchical clustering is proposed.
Fengfeng Duan, Qicong Zhang
doaj +1 more source
Linear-time Suffix Sorting - A New Approach for Suffix Array Construction [PDF]
This paper presents a new approach for linear-time suffix sorting. It introduces a new sorting principle that can be used to build the first non-recursive linear-time suffix array construction algorithm named GSACA. Although GSACA cannot keep up with the
Baier, Uwe
core +1 more source
Pengkontruksian Bidirected Overlap Graph untuk Perakitan Sekuens DNA
De novo DNA (Deoxyribonucleic Acid) sequence assembly atau perakitan sekuens DNA secara De novo adalah tahapan yang sangat penting dalam analisis sekuens DNA.
Wisnu Ananta Kusuma, Albert Adrianus
doaj +1 more source
Background A large number of researchers have devoted to accelerating the speed of genome sequencing and reducing the cost of genome sequencing for decades, and they have made great strides in both areas, making it easier for researchers to study and ...
Zhiwen Lu +3 more
doaj +1 more source
Suppose we have a large dictionary of strings. Each entry starts with a figure of merit (popularity). We wish to find the k-best matches for a substring, s, in a dictinoary, dict. That is, grep s dict | sort -n | head -k, but we would like to do this in sublinear time.
Kenneth Ward Church +2 more
openaire +2 more sources
Algorithms for enhanced suffix array [PDF]
Suffix tree is one of the most important data structures in string processing. However, the space consumption of the suffix tree is a bottleneck in large scale applications. Suffix array is by contrast a space efficient data structure having not so large
Šedek, Jindřich
core +2 more sources
An optimized FM-index library for nucleotide and amino acid search
Background Pattern matching is a key step in a variety of biological sequence analysis pipelines. The FM-index is a compressed data structure for pattern matching, with search run time that is independent of the length of the database text ...
Tim Anderson, Travis J. Wheeler
doaj +1 more source

