Results 11 to 20 of about 58,659 (213)
The suffix binary search tree and suffix AVL tree
Journal of Discrete Algorithms, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Irving, Robert W., Love, Lorna
openaire +3 more sources
Replacing suffix trees with enhanced suffix arrays
Journal of Discrete Algorithms, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abouelhoda, Mohamed Ibrahim +2 more
openaire +3 more sources
The Computer Journal, 2017 Accepted to The Computer Journal.
Farruggia, Andrea +4 more
openaire +5 more sources
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
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
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
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
Reversed Lempel–Ziv Factorization with Suffix Trees
Algorithms, 2021 We present linear-time algorithms computing the reversed Lempel–Ziv factorization [Kolpakov and Kucherov, TCS’09] within the space bounds of two different suffix tree representations.
Dominik Köppl
doaj +1 more source
IEEE Access, 2020 In order to achieve content-based binocular stereoscopic image or video retrieval efficiently, a feature indexing algorithm based on hybrid grid multiple suffix tree and hierarchical clustering is proposed.
Fengfeng Duan, Qicong Zhang
doaj +1 more source
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings [PDF]
, 2015 We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this structure,
Rubinchik, Mikhail, Shur, Arseny M.
core +1 more source