Results 31 to 40 of about 40,875 (196)
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
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
String Indexing with Compressed Patterns [PDF]
, 2020 Given a string S of length n, the classic string indexing problem is to preprocess S into a compact data structure that supports efficient subsequent pattern queries.
, Bille, Philip, Steiner, Teresa Anna
core +2 more sources
Pattern Matching on Sparse Suffix Trees [PDF]
, 2011 International audienceWe consider a compact text index based on evenly spaced sparse suffix trees of a text [9]. Such a tree is defined by partitioning the text into blocks of equal size and constructing the suffix tree only for those suffixes that start
Kolpakov, Roman +2 more
core +7 more sources
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
Cross-Document Pattern Matching [PDF]
, 2012 We study a new variant of the string matching problem called cross-document string matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a ...
A. Andersson +14 more
core +7 more sources
Doubts on Irish Iubhar 'Yew Tree' and Eburacum or York [PDF]
Вопросы ономастики, 2019 York, a cathedral city in the north of England, was the Eburacum or Colonia Eburacensis of Roman Britain. Its name has usually been explained from Irish iubhar ‘yew tree’ (or alternatively from Welsh efwr ‘hogweed’) and so ‘place where yew trees grow ...
Andrew Breeze
doaj +1 more source