Results 1 to 10 of about 1,070,371 (211)
Algorithms, 2018 We consider a sliding window W over a stream of characters from some alphabet of constant size. We want to look up a pattern in the current sliding window content and obtain all positions of the matches.
Andrej Brodnik, Matevž Jekovec
doaj +5 more sources
Parallel and private generalized suffix tree construction and query on genomic data [PDF]
BMC Genomic Data, 2022 Background Several technological advancements and digitization of healthcare data have provided the scientific community with a large quantity of genomic data. Such datasets facilitated a deeper understanding of several diseases and our health in general.
Md Momin Al Aziz +2 more
doaj +2 more sources
A novel linear indexing method for strings under all internal nodes in a suffix tree [PDF]
Frontiers in BioinformaticsSuffix trees are fundamental data structures in stringology and have wide applications across various domains. In this work, we propose two linear-time algorithms for indexing strings under each internal node in a suffix tree while preserving the ability
Anas Al-okaily, Abdelghani Tbakhi
doaj +2 more sources
Sequence Comparison Alignment-Free Approach Based on Suffix Tree and L-Words Frequency [PDF]
The Scientific World Journal, 2012 The vast majority of methods available for sequence comparison rely on a first sequence alignment step, which requires a number of assumptions on evolutionary history and is sometimes very difficult or impossible to perform due to the abundance of gaps ...
Inês Soares, Ana Goios, António Amorim
doaj +2 more sources
The afterlife of a horizontally transferred gene: Expansion and functional diversification of a C1A peptidase in wild Hordeum species. [PDF]
Plant GenomeAbstract Horizontal gene transfer (HGT) can accelerate plant adaptation, but the evolutionary fate of newly acquired nuclear genes is often unclear. Here, we analyzed a papain‐like cysteine peptidase horizontally transferred from Panicoideae to wild Hordeum (Poaceae). Using chromosome‐level assemblies of 21 diploid Hordeum species, we assessed presence/
Mahelka V +9 more
europepmc +2 more sources
Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
Algorithms, 2021 We present algorithms computing the non-overlapping Lempel–Ziv-77 factorization and the longest previous non-overlapping factor table within small space in linear or near-linear time with the help of modern suffix tree representations fitting into ...
Dominik Köppl
doaj +1 more source
Intent Arabic text categorisation based on different machine learning and term frequency
IET Networks, EarlyView., 2022 Abstract The complexity of Internet network configurations has made managing networks a complicated undertaking. Intent‐Based Networking (IBN) is a potential solution to this issue. In contrast to conventional networks, where a concrete description of the settings typically conveys a network administrator's goal kept on each device, an administrator's ...
Mohammad Fadhil Mahdi +1 more
wiley +1 more source
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
A New Algorithm and Its Application in Detecting Community of the Bipartite Complex Network
Complexity, 2021 The community division of bipartite networks is one frontier problem on the research of complex networks today. In this study, we propose a model of community detection of the bipartite network, which is based on the generalized suffix tree algorithm ...
Zhongyi Lei, Haiying Wang
doaj +1 more source
Analysis of the average depth in a suffix tree under a Markov model [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In this report, we prove that under a Markovian model of order one, the average depth of suffix trees of index n is asymptotically similar to the average depth of tries (a.k.a. digital trees) built on n independent strings.
Julien Fayolle, Mark Daniel Ward
doaj +1 more source