scientific article
From MaRDI portal
Publication:3690245
zbMath0572.68067MaRDI QIDQ3690245
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A metric index for approximate string matching, Structural properties of the string statistics problem, A linear time lower bound on McCreight and general updating algorithms for suffix trees, Sublinear approximate string matching and biological applications, Faster index for property matching, A time and space efficient data structure for string searching on large texts, On-line construction of suffix trees, Data structures and algorithms for approximate string matching, Parallel construction of a suffix tree with applications, Indexing factors with gaps, Approximate string matching with compressed indexes, Data structures and algorithms for the string statistics problem, Compact directed acyclic word graphs for a sliding window, Replacing suffix trees with enhanced suffix arrays, Indexing text using the Ziv--Lempel trie, The suffix tree of a tree and minimizing sequential transducers, Colored range queries and document retrieval, On compressing and indexing repetitive sequences, Faster repetition-aware compressed suffix trees based on block trees, Multiple alignment of biological sequences with gap flexibility, A new class of string transformations for compressed text indexing, Reverse engineering of compact suffix trees and links: a novel algorithm, Linking indexing data structures to de Bruijn graphs: construction and update, Generalizations of suffix arrays to multi-dimensional matrices., Truncated suffix trees and their application to data compression., String matching with alphabet sampling, String Covering: A Survey, Linear-time construction of two-dimensional suffix trees, Stronger Lempel-Ziv based compressed text indexing, Time-Optimal Top-$k$ Document Retrieval, Sparse suffix trees, Parallel construction of minimal suffix and factor automata, Irredundant tandem motifs, Wavelet trees for all, On the height of digital trees and related problems, Textual data compression in computational biology: algorithmic techniques, Efficient parallel algorithms to test square-freeness and factorize strings, Practical compressed suffix trees, Inferring strings from suffix trees and links on a binary alphabet, Algorithms for Indexing Highly Similar DNA Sequences, Rank and select revisited and extended, On-line construction of compact suffix vectors and maximal repeats, On-line construction of two-dimensional suffix trees, Efficient detection of quasiperiodicities in strings, Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter, A randomized numerical aligner (rNA), Computing regularities in strings: a survey, On finding common subtrees, On-line construction of compact directed acyclic word graphs, Linear time algorithms for generalizations of the longest common substring problem, Spaces, Trees, and Colors, Space-efficient construction of Lempel-Ziv compressed text indexes, Optimal parallel suffix tree construction, Optimal prefix and suffix queries on texts, On suffix extensions in suffix trees, Simple and flexible detection of contiguous repeats using a suffix tree, Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree, Locally Compressed Suffix Arrays, Speeding up two string-matching algorithms, Reconstructing a history of recombinations from a set of sequences, The suffix binary search tree and suffix AVL tree, Generalizations of suffix arrays to multi-dimensional matrices., Faster entropy-bounded compressed suffix trees, Parallel construction and query of index data structures for pattern matching on square matrices, Distributed suffix trees, Sequential and indexed two-dimensional combinatorial template matching allowing rotations, Perspectives: Journal of Discrete Algorithms Special StringMasters Issue (2015), The smallest automaton recognizing the subwords of a text, Faster Compressed Suffix Trees for Repetitive Collections, String inference from longest-common-prefix array, Space-efficient representation of truncated suffix trees, with applications to Markov order estimation, Succinct dynamic cardinal trees
