scientific article; zbMATH DE number 432779
From MaRDI portal
Publication:3138909
Cited in
(50)- Efficient CRCW-PRAM algorithms for universal substring searching
- DSI: Distributed service integration for service grid
- On the string matching with \(k\) mismatches
- A randomized numerical aligner (rNA)
- Computing regularities in strings: a survey
- Combinatorial algorithms for DNA sequence assembly
- Towards a real time algorithm for parameterized longest common prefix computation
- An elegant algorithm for the construction of suffix arrays
- Distributed suffix trees
- On minimizing pattern splitting in multi-track string matching
- Optimal in-place suffix sorting
- Linear construction of a left Lyndon tree
- A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm
- Succincter text indexing with wildcards
- Full-text indexes for high-throughput sequencing
- DNA-seq error correction based on substring indices
- The contig assembly problem and its algorithmic solutions
- Arithmetics on suffix arrays of Fibonacci words
- Indexing Structure for Graph-Structured Data
- Linear Time Suffix Array Construction Using D-Critical Substrings
- Compressed indexes for text with wildcards
- Suffix array and Lyndon factorization of a text
- On the number of elements to reorder when updating a suffix array
- Random suffix search trees
- Forty Years of Text Indexing
- What's behind blast
- An index data structure for matrices, with applications to fast two-dimensional pattern matching
- Sufficient conditions for efficient indexing under different matchings
- Detecting mutations by eBWT
- Byte-aligned pattern matching in encoded genomic sequences
- Space-efficient parallel construction of succinct representations of suffix tree topologies
- Pattern matching in pseudo real-time
- Data compression with long repeated strings
- scientific article; zbMATH DE number 7765421 (Why is no real title available?)
- Classical and quantum algorithms for constructing text from dictionary problem
- Optimized binary search and text retrieval
- Classical and Quantum Algorithms for Assembling a Text from a Dictionary
- String Covering: A Survey
- Quantum algorithm for lexicographically minimal string rotation
- On the optimisation of the GSACA suffix array construction algorithm
- Suffix arrays for multiple strings: a method for on-line multiple string searches
- Searching 2D-strings for matching frames
- Lyndon arrays simplified
- Generic non-recursive suffix array construction
- Height-bounded Lempel-Ziv encodings
- A four-stage algorithm for updating a Burrows-Wheeler transform
- Fast and lightweight distributed suffix array construction
- An algorithm for string matching with a sequence of don't cares
- Efficient computation of shortest absent words in a genomic sequence
- Dynamic extended suffix arrays
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 Q3138909)
