Publication:3138909
From MaRDI portal
zbMath0800.68364MaRDI QIDQ3138909
Publication date: 2 January 1994
68P10: Searching and sorting
Related Items
Random suffix search trees, Forty Years of Text Indexing, Unnamed Item, Unnamed Item, What’s Behind Blast, An index data structure for matrices, with applications to fast two-dimensional pattern matching, Detecting Mutations by eBWT, Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies, Data compression with long repeated strings, Unnamed Item, 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, On the optimisation of the GSACA suffix array construction algorithm, 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, Pattern matching in pseudo real-time, A four-stage algorithm for updating a Burrows-Wheeler transform, 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, 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
