Publication:4547749
From MaRDI portal
zbMath0990.68639MaRDI QIDQ4547749
Hiroki Arimura, Gunho Lee, Toru Kasai, Kun Soo Park, Setsuo Arikawa
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2089/20890181
Related Items
Better External Memory LCP Array Construction, Forty Years of Text Indexing, Unnamed Item, Unnamed Item, Unnamed Item, Dichotomic Selection on Words: A Probabilistic Analysis, Small-space LCE data structure with constant-time queries, Inducing Suffix and LCP Arrays in External Memory, LCP Array Construction in External Memory, On Undetected Redundancy in the Burrows-Wheeler Transform, Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies, Range LCP, Property Suffix Array with Applications in Indexing Weighted Sequences, Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads, Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions, One-variable word equations in linear time, Computing minimal and maximal suffixes of a substring, Optimal suffix sorting and LCP array construction for constant alphabets, Efficient algorithms for three variants of the LPF table, On the number of elements to reorder when updating a suffix array, Parameterized longest previous factor, A linearly computable measure of string complexity, A simple yet time-optimal and linear-space algorithm for shortest unique substring queries, Using static suffix array in dynamic application: case of text compression by longest first substitution, Alphabet-independent algorithms for finding context-sensitive repeats in linear time, A note on the longest common compatible prefix problem for partial words, Efficient pattern matching for RNA secondary structures, Linear-time computation of prefix table for weighted strings {\&} applications, Burrows-Wheeler transform and LCP array construction in constant space, Inducing enhanced suffix arrays for string collections, A practical semi-external memory method for approximate pattern matching, A quick tour on suffix arrays and compressed suffix arrays, Linear time algorithms for generalizations of the longest common substring problem, The longest common extension problem revisited and applications to approximate string searching, Fast, practical algorithms for computing all the repeats in a string, New results on Nyldon words and Nyldon-like sets, Computing suffix links for suffix trees and arrays, Replacing suffix trees with enhanced suffix arrays, Counting suffix arrays and strings, Computing longest previous factor in linear time and applications, Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem, Wee LCP, Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays, Lossless filter for multiple repetitions with Hamming distance, Faster entropy-bounded compressed suffix trees, Extended suffix array construction using Lyndon factors, Computing longest common extensions in partial words, EERTREE: an efficient data structure for processing palindromes in strings, Algorithms and combinatorial properties on shortest unique palindromic substrings, On string matching with mismatches, Computing regularities in strings: a survey, Computing the longest previous factor, Variations of the parameterized longest previous factor, Computing longest previous non-overlapping factors, Computing the multi-string BWT and LCP array in external memory, The exact multiple pattern matching problem solved by a reference tree approach, Faster online computation of the succinct longest previous factor array, Quantum algorithm for learning secret strings and its experimental demonstration, Efficient computation of sequence mappability, Space-efficient construction of compressed suffix trees, Efficient algorithms for the longest common subsequence in \(k\)-length substrings, Efficient computation of longest single-arm-gapped palindromes in a string, Approximate periodicity, Faster average case low memory semi-external construction of the Burrows-Wheeler transform, In-place algorithms for exact and approximate shortest unique substring problems, Efficient computation of substring equivalence classes with suffix arrays, Computing the Burrows-Wheeler transform of a string and its reverse in parallel, Compressing table data with column dependency, Constructing suffix arrays in linear time, Space efficient linear time construction of suffix arrays, Lightweight LCP construction for very large collections of strings, An improved algorithm for the all-pairs suffix-prefix problem, LZRR: LZ77 parsing with right reference, An Opportunistic Text Indexing Structure Based on Run Length Encoding, Computing Longest Single-arm-gapped Palindromes in a String, Lempel-Ziv Factorization Revisited, Sparse and Truncated Suffix Trees on Variable-Length Codes, Unnamed Item, Full-Text Indexes for High-Throughput Sequencing, An Online Algorithm for Finding the Longest Previous Factors, Permuted Longest-Common-Prefix Array
