scientific article; zbMATH DE number 1786458
From MaRDI portal
Publication:4547749
zbMATH Open0990.68639MaRDI QIDQ4547749FDOQ4547749
Authors: Toru Kasai, Gunho Lee, Hiroki Arimura, S. Arikawa, Kunsoo Park 
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2089/20890181
Title of this publication is not available (Why is that?)
Recommendations
Cited In (96)
- Compressing table data with column dependency
- New results on Nyldon words and Nyldon-like sets
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Efficient algorithms for three variants of the LPF table
- Parameterized longest previous factor
- One-variable word equations in linear time
- Computing longest common extensions in partial words
- Title not available (Why is that?)
- A quick tour on suffix arrays and compressed suffix arrays
- Faster entropy-bounded compressed suffix trees
- Replacing suffix trees with enhanced suffix arrays
- Algorithm Theory - SWAT 2004
- Space efficient linear time construction of suffix arrays
- Variations of the parameterized longest previous factor
- On the number of elements to reorder when updating a suffix array
- Computing longest previous factor in linear time and applications
- Extended suffix array construction using Lyndon factors
- Counting suffix arrays and strings
- Computing the longest common prefix array based on the Burrows-Wheeler transform
- Computing regularities in strings: a survey
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel
- Computing minimal and maximal suffixes of a substring
- Lightweight LCP construction for very large collections of strings
- Permuted Longest-Common-Prefix Array
- A linearly computable measure of string complexity
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- The longest common extension problem revisited and applications to approximate string searching
- Range LCP
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings
- An improved algorithm for the all-pairs suffix-prefix problem
- LZRR: LZ77 parsing with right reference
- Wee LCP
- Sampled Longest Common Prefix Array
- Small-space LCE data structure with constant-time queries
- Faster average case low memory semi-external construction of the Burrows-Wheeler transform
- Space-efficient construction of compressed suffix trees
- 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
- Computing the longest previous factor
- On Undetected Redundancy in the Burrows-Wheeler Transform
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
- Optimal suffix sorting and LCP array construction for constant alphabets
- Constructing suffix arrays in linear time
- Computing Longest Common Substrings Via Suffix Arrays
- An Online Algorithm for Finding the Longest Previous Factors
- Computing longest previous non-overlapping factors
- A note on the longest common compatible prefix problem for partial words
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time
- All-pairs suffix/prefix in optimal time using Aho-Corasick space
- Fast, practical algorithms for computing all the repeats in a string
- Efficient pattern matching for RNA secondary structures
- Inducing Suffix and LCP Arrays in External Memory
- LCP Array Construction in External Memory
- Computing suffix links for suffix trees and arrays
- Lempel-Ziv Factorization Revisited
- Lossless filter for multiple repetitions with Hamming distance
- Linear-time computation of prefix table for weighted strings {\&} applications
- Burrows-Wheeler transform and LCP array construction in constant space
- EERTREE: an efficient data structure for processing palindromes in strings
- On string matching with mismatches
- Inducing enhanced suffix arrays for string collections
- A practical semi-external memory method for approximate pattern matching
- Linear time algorithms for generalizations of the longest common substring problem
- Efficient computation of sequence mappability
- Faster online computation of the succinct longest previous factor array
- Better External Memory LCP Array Construction
- In-place algorithms for exact and approximate shortest unique substring problems
- String Covering: A Survey
- Quantum algorithm for learning secret strings and its experimental demonstration
- Computing the multi-string BWT and LCP array in external memory
- Title not available (Why is that?)
- Property Suffix Array with Applications in Indexing Weighted Sequences
- The colored longest common prefix array computed via sequential scans
- Dichotomic Selection on Words: A Probabilistic Analysis
- Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions
- Full-Text Indexes for High-Throughput Sequencing
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
- Computing Longest Single-arm-gapped Palindromes in a String
- Sparse and truncated suffix trees on variable-length codes
- An Opportunistic Text Indexing Structure Based on Run Length Encoding
- Approximate periodicity
- Longest property-preserved common factor: a new string-processing framework
- Forty Years of Text Indexing
- The exact multiple pattern matching problem solved by a reference tree approach
- Title not available (Why is that?)
- Checking Big Suffix and LCP Arrays by Probabilistic Methods
- Efficient computation of longest single-arm-gapped palindromes in a string
- Efficient computation of substring equivalence classes with suffix arrays
- Title not available (Why is that?)
- Computing all-vs-all MEMs in run-length-encoded collections of HiFi reads
- Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
- \(r\)-indexing the eBWT
- Computing all-vs-all MEMs in grammar-compressed text
- Sparse suffix and LCP array: simple, direct, small, and fast
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547749)
