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