Buscar
Mostrando ítems 1-10 de 360
Relative Suffix Trees
(The British Computer Society, 2018-05)
Suffix trees are one of the most versatile data structures in stringology, with many applications in bioinformatics. Their main drawback is their size, which can be tens of times larger than the input sequence. Much effort ...
An Improved Algorithm For The All-pairs Suffix-prefix Problem
(Elsevier Science BVAmsterdam, 2016)
A grammar compression algorithm based on induced suffix sorting
(Institute of Electrical and Electronics Engineers Inc., 2018)
We introduce GCIS, a grammar compression algorithm based on the induced suffix sorting algorithm SAIS, presented by Nong et al. in 2009. Our solution builds on the factorization performed by SAIS during suffix sorting. We ...
Parallel Computation For The All-pairs Suffix-prefix Problem
(Springer Int Publishing AGCham, 2016)
A living suffix: general observations on the suffix –ee in English
(Universidad de Chile, 1975)
Mataguayan
(Oxford University Press, 2014)
This chapter addresses the derivational processes employed by the Mataguayan languages to form words. In particular, it focuses on nominal and verbal suffixation, this being the most productive and diffused word-formation ...
Análise morfo-semântica de alguns pares de sufixos eruditos e populares latinos no período entre os séculos XII a XVI
(Universidade Estadual Paulista (Unesp), 2008-08-28)
Dans ce travail, on a eu le dessein d’ analyser l' évolution des signifiés de quelques suffixes latins (érudits) utilisés en portugais archaïque et qui présentent une contrepartie populaire. D’abord, on a repassé l'Histoire, ...
Optimal Suffix Sorting And Lcp Array Construction For Constant Alphabets
(Elsevier Science BVAmsterdam, 2017)
Análise morfo-semântica de alguns pares de sufixos eruditos e populares latinos no período entre os séculos XII a XVI
(Universidade Estadual Paulista (UNESP), 2014)