scientific article; zbMATH DE number 2038766

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190943.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items

A metric index for approximate string matching, Faster average case low memory semi-external construction of the Burrows-Wheeler transform, Construction of Aho Corasick automaton in linear time for integer alphabets, Computing suffix links for suffix trees and arrays, Self-indexed Text Compression Using Straight-Line Programs, Computing longest common extensions in partial words, Indexing factors with gaps, Parallel lightweight wavelet tree, suffix array and FM-index construction, Replacing suffix trees with enhanced suffix arrays, Locating maximal approximate runs in a string, Extracting powers and periods in a word from its runs structure, On compressing and indexing repetitive sequences, Efficient seed computation revisited, Optimal in-place suffix sorting, LZRR: LZ77 parsing with right reference, The longest common extension problem revisited and applications to approximate string searching, Finding the cyclic covers of a string, Improved characters distance sampling for online and offline text searching, Searching for Gapped Palindromes, Efficient algorithms for three variants of the LPF table, On the number of elements to reorder when updating a suffix array, Parallel suffix sorting for large string analytics, Fast, practical algorithms for computing all the repeats in a string, String Covering: A Survey, On demand string sorting over unbounded alphabets, Period recovery of strings over the Hamming and edit distances, A survey of string orderings and their application to the Burrows-Wheeler transform, A bijective variant of the Burrows-Wheeler transform using \(V\)-order, On the combinatorics of suffix arrays, Text indexing with errors, Better External Memory LCP Array Construction, Fast profile matching algorithms - A survey, Counting suffix arrays and strings, Property matching and weighted matching, A note on the longest common compatible prefix problem for partial words, Algorithms for Indexing Highly Similar DNA Sequences, Fast BWT in small space by blockwise suffix sorting, An extension of the Burrows-Wheeler transform, Scalable Parallel Suffix Array Construction, Binary block order Rouen transform, An elegant algorithm for the construction of suffix arrays, A practical semi-external memory method for approximate pattern matching, Computing longest previous factor in linear time and applications, A new combinatorial approach to sequence comparison, Computing regularities in strings: a survey, Computing the longest previous factor, Linear time algorithms for generalizations of the longest common substring problem, Forty Years of Text Indexing, A note on the Burrows-Wheeler transformation, GAME: A simple and efficient whole genome alignment method using maximal exact match filtering, Unnamed Item, Unnamed Item, Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays, The alternating BWT: an algorithmic perspective, Lossless filter for multiple repetitions with Hamming distance, Range LCP, Linear Time Suffix Array Construction Using D-Critical Substrings, Permuted Longest-Common-Prefix Array, Dichotomic Selection on Words: A Probabilistic Analysis, Real two dimensional scaled matching, Faster entropy-bounded compressed suffix trees, Constructing suffix arrays in linear time, Space efficient linear time construction of suffix arrays, Approximate periodicity, Inducing Suffix and LCP Arrays in External Memory, LCP Array Construction in External Memory