scientific article; zbMATH DE number 1786458
From MaRDI portal
Publication:4547749
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (82)
New results on Nyldon words and Nyldon-like sets ⋮ Extended suffix array construction using Lyndon factors ⋮ Faster average case low memory semi-external construction of the Burrows-Wheeler transform ⋮ Computing minimal and maximal suffixes of a substring ⋮ Efficient computation of sequence mappability ⋮ Lightweight LCP construction for very large collections of strings ⋮ An improved algorithm for the all-pairs suffix-prefix problem ⋮ Unnamed Item ⋮ Computing suffix links for suffix trees and arrays ⋮ Computing longest common extensions in partial words ⋮ Optimal suffix sorting and LCP array construction for constant alphabets ⋮ In-place algorithms for exact and approximate shortest unique substring problems ⋮ Replacing suffix trees with enhanced suffix arrays ⋮ Efficient computation of substring equivalence classes with suffix arrays ⋮ EERTREE: an efficient data structure for processing palindromes in strings ⋮ An Opportunistic Text Indexing Structure Based on Run Length Encoding ⋮ LZRR: LZ77 parsing with right reference ⋮ Variations of the parameterized longest previous factor ⋮ The longest common extension problem revisited and applications to approximate string searching ⋮ Property Suffix Array with Applications in Indexing Weighted Sequences ⋮ Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads ⋮ Efficient algorithms for three variants of the LPF table ⋮ On the number of elements to reorder when updating a suffix array ⋮ Fast, practical algorithms for computing all the repeats in a string ⋮ String Covering: A Survey ⋮ Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions ⋮ Computing longest previous non-overlapping factors ⋮ Computing Longest Single-arm-gapped Palindromes in a String ⋮ Parameterized longest previous factor ⋮ A linearly computable measure of string complexity ⋮ Algorithms and combinatorial properties on shortest unique palindromic substrings ⋮ Computing the Burrows-Wheeler transform of a string and its reverse in parallel ⋮ Space-efficient construction of compressed suffix trees ⋮ An Online Algorithm for Finding the Longest Previous Factors ⋮ Better External Memory LCP Array Construction ⋮ 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 ⋮ Counting suffix arrays and strings ⋮ On string matching with mismatches ⋮ Alphabet-independent algorithms for finding context-sensitive repeats in linear time ⋮ A note on the longest common compatible prefix problem for partial words ⋮ Full-Text Indexes for High-Throughput Sequencing ⋮ Compressing table data with column dependency ⋮ Efficient pattern matching for RNA secondary structures ⋮ Linear-time computation of prefix table for weighted strings {\&} applications ⋮ Lempel-Ziv Factorization Revisited ⋮ Sparse and Truncated Suffix Trees on Variable-Length Codes ⋮ Burrows-Wheeler transform and LCP array construction in constant space ⋮ Inducing enhanced suffix arrays for string collections ⋮ Computing the multi-string BWT and LCP array in external memory ⋮ Efficient algorithms for the longest common subsequence in \(k\)-length substrings ⋮ A practical semi-external memory method for approximate pattern matching ⋮ Computing longest previous factor in linear time and applications ⋮ Computing regularities in strings: a survey ⋮ Computing the longest previous factor ⋮ A quick tour on suffix arrays and compressed suffix arrays ⋮ Linear time algorithms for generalizations of the longest common substring problem ⋮ Forty Years of Text Indexing ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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 ⋮ Unnamed Item ⋮ The exact multiple pattern matching problem solved by a reference tree approach ⋮ Efficient computation of longest single-arm-gapped palindromes in a string ⋮ Lossless filter for multiple repetitions with Hamming distance ⋮ Range LCP ⋮ Permuted Longest-Common-Prefix Array ⋮ Dichotomic Selection on Words: A Probabilistic Analysis ⋮ Faster entropy-bounded compressed suffix trees ⋮ Small-space LCE data structure with constant-time queries ⋮ Constructing suffix arrays in linear time ⋮ Space efficient linear time construction of suffix arrays ⋮ Approximate periodicity ⋮ Faster online computation of the succinct longest previous factor array ⋮ Inducing Suffix and LCP Arrays in External Memory ⋮ LCP Array Construction in External Memory ⋮ Quantum algorithm for learning secret strings and its experimental demonstration ⋮ On Undetected Redundancy in the Burrows-Wheeler Transform ⋮ Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies ⋮ One-variable word equations in linear time
This page was built for publication:
