Results 21 to 30 of about 40,634 (160)
Optimal Prefix and Suffix Queries on Texts [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied by Mäkinen and Navarro [Position-Restricted Substring Searching, LATIN 2006].
Maxime Crochemore +2 more
doaj +1 more source
Reflexes of a Hurrian Word in Armenian: A Theonym, a Dendronym, an Anthroponym
Вопросы ономастики, 2021 In Old Armenian, saws means ‘proud, luxurious, great,’ ‘some (bright) color,’ and saws and sawsi mean ‘oriental plane tree’. The word has no etymology. Hurrian has the word šauša [sausa] ‘big, great’ and the theonym Šauša / Šauška for the local version ...
Armen Ye. Petrosyan
doaj +1 more source
On the suitability of suffix arrays for lempel-ziv data compression [PDF]
, 2009 Lossless compression algorithms of the Lempel-Ziv (LZ) family are widely used nowadays. Regarding time and memory requirements, LZ encoding is much more demanding than decoding.
D. Gusfield +9 more
core +2 more sources
Cancer Informatics, 2009 Efficient and effective analysis of the growing genomic databases requires the development of adequate computational tools. We introduce a fast method based on the suffix tree data structure for predicting novel targets of hypoxia-inducible factor 1 (HIF-
Yue Jiang +6 more
doaj +2 more sources
Reducing the Space Requirement of Suffix Trees [PDF]
, 1998 We show that suffix trees store various kinds of redundant information. We exploit these redundancies to obtain more space efficient representations. The most space efficient of our representations requires 20 bytes per input character in the worst case,
Stefan Kurtz
core +2 more sources
Analyzing State Sequences with Probabilistic Suffix Trees: The PST R Package
Journal of Statistical Software, 2016 This article presents the PST R package for categorical sequence analysis with probabilistic suffix trees (PSTs), i.e., structures that store variable-length Markov chains (VLMCs).
Alexis Gabadinho, Gilbert Ritschard
doaj +1 more source
More Time-Space Tradeoffs for Finding a Shortest Unique Substring
Algorithms, 2020 We extend recent results regarding finding shortest unique substrings (SUSs) to obtain new time-space tradeoffs for this problem and the generalization of finding k-mismatch SUSs.
Hideo Bannai +4 more
doaj +1 more source
Local Similarity Search to Find Gene Indicators in Mitochondrial Genomes
Biology, 2014 Given a set of nucleotide sequences we consider the problem of identifying conserved substrings occurring in homologous genes in a large number of sequences.
Ruby L. V. Moritz +2 more
doaj +1 more source
Structure and Sequence Aligned Code Summarization with Prefix and Suffix Balanced Strategy
Entropy, 2023 Source code summarization focuses on generating qualified natural language descriptions of a code snippet (e.g., functionality, usage and version). In an actual development environment, descriptions of the code are missing or not consistent with the code
Jianhui Zeng, Zhiheng Qu, Bo Cai
doaj +1 more source
Computing Lempel-Ziv Factorization Online [PDF]
, 2012 We present an algorithm which computes the Lempel-Ziv factorization of a word $W$ of length $n$ on an alphabet $\Sigma$ of size $\sigma$ online in the following sense: it reads $W$ starting from the left, and, after reading each $r = O(\log_{\sigma} n ...
Starikovskaya, Tatiana
core +1 more source