Buscar
Mostrando ítems 1-10 de 39
An Improved Algorithm For The All-pairs Suffix-prefix Problem
(Elsevier Science BVAmsterdam, 2016)
Optimal Suffix Sorting And Lcp Array Construction For Constant Alphabets
(Elsevier Science BVAmsterdam, 2017)
Parallel Computation For The All-pairs Suffix-prefix Problem
(Springer Int Publishing AGCham, 2016)
Efficient repeat finding in sets of strings via suffix arrays
(Discrete Mathematics and Theoretical Computer Science, 2013-04)
We consider two repeat finding problems relative to sets of strings: (a) Find the largest substrings that occur in every string of a given set; (b) Find the maximal repeats in a given string that occur in no string of a ...
Suffix Array Performance Analysis for Multi-Core Platforms
(Andrei Tchernykh, René Luna-García, Juan Manuel Ramírez-Alcaraz: Editorial., 2013-10)
Performance analysis helps to understand how a particular invocation of an algorithm executes. Using the information provided by specific tools like the profiler tool Perf or the Performance Application Programming Interface ...
Suffix Array Performance Analysis for Multi-Core Platforms
(Revista Computación y Sistemas; Vol. 17 No.3, 2013-09-11)
Abstract. Performance analysis helps to understand how a particular invocation of an algorithm executes. Using the information provided by specific tools like the profiler tool Perf or the Performance Application Programming ...
COMPRESSED COMPACT SUFFIX ARRAYS
(SPRINGER, 2004)
The compact suffix array (CSA) is a space-efficient full-text index, which is fast in practice to search for patterns in a static text. Compared to other xompressed suffix arrays (Grossi an dVitter, Sadakane, Ferragina and ...
Using Compressed Suffix-Arrays for a Compact Representation of Temporal-Graphs
(2018)
Temporal graphs represent binary relationships that change along time. They can model the dynamism of, for example, social and communication networks. Temporal graphs are defined as sets of contacts that are edges tagged ...