Results 91 to 100 of about 14,465 (182)

Better external memory suffix array construction

ACM Journal of Experimental Algorithmics, 2008
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications, in particular, in bioinformatics. However, so far, it has appeared prohibitive to build suffix arrays for huge inputs that do not fit into main memory. This paper presents design,
Dementiev, Roman, Kärkkäinen, Juha, Mehnert, Jens, Sanders, Peter   +3 more
openaire   +4 more sources

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

Revista 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, Ricardo Baeza-Yates   +1 more
doaj  

Finding All-Pairs Suffix-Prefix Matching Using Suffix Array

The KIPS Transactions:PartA, 2010
ABSTRACT Since string operations were applied to computational biology, security and search for Internet, various data structures and algorithms for computing efficient string operations have been studied. The all-pairs suffix-prefix matching is to find the longest suffix and prefix among given strings.
Seon-Mi Han, Jin-Woon Woo
openaire   +2 more sources

Using Suffix Arrays to Compute Term Frequency and Document Frequency for All Substrings in a Corpus

Computational Linguistics, 2021
Mikio Yamamoto, Kenneth W. Church
doaj   +1 more source

Generic Non-recursive Suffix Array Construction

ACM Transactions on Algorithms
The suffix array is arguably one of the most important data structures in sequence analysis and consequently there is a multitude of suffix sorting algorithms. However, to this date the GSACA algorithm introduced in 2015 is the only known non-recursive linear-time suffix array construction algorithm (SACA).
Jannik Olbrich, Enno Ohlebusch, Thomas Büchler   +2 more
openaire   +1 more source

Bitpacking techniques for indexing genomes: II. Enhanced suffix arrays. [PDF]

Algorithms Mol Biol, 2016
Wu TD.
europepmc   +1 more source

An Elegant Algorithm for the Construction of Suffix Arrays. [PDF]

J Discrete Algorithms (Amst), 2014
Rajasekaran S, Nicolae M.
europepmc   +1 more source

Inexact Local Alignment Search over Suffix Arrays. [PDF]

Proceedings (IEEE Int Conf Bioinformatics Biomed), 2009
Ghodsi M, Pop M.
europepmc   +1 more source

FastGA: fast genome alignment. [PDF]

Bioinform Adv
Myers G, Durbin R, Zhou C.
europepmc   +2 more sources

Prefix-free parsing for merging big BWTs. [PDF]

Int Symp String Process Inf Retr
Díaz-Domínguez D, Gagie T, Guerrini V, Langmead B, Lipták Z, Manzini G, Masillo F, Shivakumar V.   +7 more
europepmc   +1 more source