scientific article; zbMATH DE number 2038766
From MaRDI portal
Publication:4449231
zbMATH Open1039.68042MaRDI QIDQ4449231FDOQ4449231
Authors: Juha Kärkkäinen, Peter Sanders 
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190943.htm
Title of this publication is not available (Why is that?)
Recommendations
Cited In (71)
- Parallel suffix sorting for large string analytics
- String Covering: A Survey
- Dichotomic Selection on Words: A Probabilistic Analysis
- Finding the cyclic covers of a string
- Better external memory LCP array construction
- GAME: A simple and efficient whole genome alignment method using maximal exact match filtering
- Optimal in-place suffix sorting
- Improved characters distance sampling for online and offline text searching
- Locating maximal approximate runs in a string
- Efficient seed computation revisited
- Title not available (Why is that?)
- Space efficient linear time construction of suffix arrays
- Efficient algorithms for three variants of the LPF table
- Parallel lightweight wavelet tree, suffix array and FM-index construction
- Computing longest common extensions in partial words
- Faster entropy-bounded compressed suffix trees
- Replacing suffix trees with enhanced suffix arrays
- Inducing suffix and LCP arrays in external memory
- LCP array construction in external memory
- Space efficient linear time construction of suffix arrays
- Fast profile matching algorithms - A survey
- On the number of elements to reorder when updating a suffix array
- On demand string sorting over unbounded alphabets
- Computing longest previous factor in linear time and applications
- Title not available (Why is that?)
- Property matching and weighted matching
- A simple algorithm for computing the document array
- Construction of Aho Corasick automaton in linear time for integer alphabets
- Linear-time suffix sorting -- a new approach for suffix array construction
- Counting suffix arrays and strings
- Linear-time construction of suffix arrays (extended abstract)
- Computing regularities in strings: a survey
- A note on the Burrows-Wheeler transformation
- Algorithms for indexing highly similar DNA sequences
- Extracting powers and periods in a word from its runs structure
- On compressing and indexing repetitive sequences
- Permuted Longest-Common-Prefix Array
- 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
- A metric index for approximate string matching
- Approximate periodicity
- LZRR: LZ77 parsing with right reference
- Real two dimensional scaled matching
- An extension of the Burrows-Wheeler transform
- Fast BWT in small space by blockwise suffix sorting
- A new combinatorial approach to sequence comparison
- Forty Years of Text Indexing
- Faster average case low memory semi-external construction of the Burrows-Wheeler transform
- An elegant algorithm for the construction of suffix arrays
- Self-indexed Text Compression Using Straight-Line Programs
- Computing the longest previous factor
- On the combinatorics of suffix arrays
- Constructing suffix arrays in linear time
- Linear Time Suffix Array Construction Using D-Critical Substrings
- A note on the longest common compatible prefix problem for partial words
- Indexing factors with gaps
- Linear work suffix array construction
- Fast, practical algorithms for computing all the repeats in a string
- The alternating BWT: an algorithmic perspective
- A survey of string orderings and their application to the Burrows-Wheeler transform
- Period recovery of strings over the Hamming and edit distances
- Computing suffix links for suffix trees and arrays
- Searching for Gapped Palindromes
- Lossless filter for multiple repetitions with Hamming distance
- Text indexing with errors
- Binary block order Rouen transform
- Scalable Parallel Suffix Array Construction
- A bijective variant of the Burrows-Wheeler transform using \(V\)-order
- A practical semi-external memory method for approximate pattern matching
- Linear time algorithms for generalizations of the longest common substring problem
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 Q4449231)
