Results 31 to 40 of about 3,800 (211)
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
Suffix trees as language models [PDF]
, 2023 Suffix trees are data structures that can be used to index a corpus. In this paper, we explore how some properties of suffix trees naturally provide the functionality of an n-gram language model with variable n.
Redd Kennington, Casey +2 more
core
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
Suffix Trees Capabilities [PDF]
, 2020 This thesis discusses structure of suffix trees, their implementation and problematics, we can solved with suffix trees. The thesis also focuses on construction of suffix trees, with usage of Ukkonen's algorithm. Apart of implementation of this structure
Chlubna, Pavel
core
Suffix Trees for Document Retrieval [PDF]
, 2012 This thesis presents a look at the suitability of Suffix Trees for full text indexing and retrieval. Typically suffix trees are built on a character level, where the tree records which characters follow each other character.
Reck, Ryan
core +2 more sources
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
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
Suffix trees for very large inputs [PDF]
, 2010 A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs.
Barsky, Marina
core +2 more sources