Results 41 to 50 of about 1,070,371 (211)
Representing the suffix tree with the CDAWG
CoRR, 2017 Given a string $T$, it is known that its suffix tree can be represented using the compact directed acyclic word graph (CDAWG) with $e_T$ arcs, taking overall $O(e_T+e_{\overline{T}})$ words of space, where ${\overline{T}}$ is the reverse of $T$, and supporting some key operations in time between $O(1)$ and $O(\log{\log{n}})$ in the worst case.
Belazzougui, Djamal, Cunial, Fabio
openaire +5 more sources
Weighted Ancestors in Suffix Trees [PDF]
, 2014 The classical, ubiquitous, predecessor problem is to construct a data structure for a set of integers that supports fast predecessor queries. Its generalization to weighted trees, a.k.a. the weighted ancestor problem, has been extensively explored and successfully reduced to the predecessor problem.
Gawrychowski, P. +2 more
openaire +4 more sources
Costruzione space efficient di un suffix tree troncato con codifica TruST
, 2022 Argomento della tesi è il suffix tree troncato, che ha la struttura ad albero ma occupa meno spazio del suffix tree. Il procedimento originariamente usato nella costruzione del suffix tree troncato con codifica TruST si basa sulla codifica derivata da ...
Pelizzari, Gabriele
core
Compressed property suffix trees
Information and Computation, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wing-Kai Hon +3 more
openaire +4 more sources
Fast Hybrid Data Structure for a Large Alphabet K-Mers Indexing for Whole Genome Alignment
IEEE Access, 2021 The most common index data structures used by whole genome aligners (WGA) are based on suffix trees (ST), suffix arrays, and FM-indexes. These data structures show good performance results as WGA works with sequences of letters over small alphabets; for ...
Rostislav Hrivnak +2 more
doaj +1 more source
Land Degradation &Development, EarlyView.ABSTRACT A decade after Land Degradation Neutrality was incorporated into Sustainable Development Goal 15.3, implementation outcomes across the Global South remain uneven. Mainstream commons research identifies recurring institutional features, whereas critical institutionalism emphasizes their adaptive assembly; both traditions increasingly recognize ...
Tengyuan Yang, Senbao Lu, Jiapeng Dai
wiley +1 more source
BuST-Bundled Suffix Trees [PDF]
, 2006 We introduce a data structure, the Bundled Suffix Tree (BUST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a non-transitive relation ≈ among its letters. Following the path of a substring β within a BUST, constructed over a text α of length n, not only the positions of the exact occurrences of β in
Luca Bortolussi +2 more
openaire +3 more sources
Wavelet Trees Meet Suffix Trees [PDF]
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014 33 pages, 5 figures; preliminary version published at SODA ...
Babenko, M. +3 more
openaire +5 more sources
Robust β‐myrcene block copolymer elastomeric vitrimers
Polymer International, EarlyView.Myrcene‐based vitrimeric elastomers were compared: statistical (poly(styrene‐stat‐myrcene‐stat‐AAEMA)] versus ‘hard–soft’ diblock (poly(styrene)‐block‐poly(myrcene‐co‐AAEMA)). The diblock's ability to anchor the glassy poly(styrene) blocks in a self‐assembled microstructure was effective – leading to four times higher tensile stress and ten times ...
Chong Yang Du +2 more
wiley +1 more source
Journal of the Royal Anthropological Institute, EarlyView.Anthropologists have long shown that asking for food in times of need is morally valued in rural Namibia. Yet among the Damara pastoralists with whom I work, people now increasingly describe feeling shame (taob) when they ask for food. In this article, I trace this shift to the affective dynamics of social class formation.
Michael Schnegg
wiley +1 more source