scientific article
From MaRDI portal
Publication:3138909
zbMath0800.68364MaRDI QIDQ3138909
Publication date: 2 January 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Arithmetics on Suffix Arrays of Fibonacci Words, An index data structure for matrices, with applications to fast two-dimensional pattern matching, Combinatorial algorithms for DNA sequence assembly, A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm, Compressed indexes for text with wildcards, Optimal in-place suffix sorting, Linear construction of a left Lyndon tree, Suffix array and Lyndon factorization of a text, Classical and quantum algorithms for constructing text from dictionary problem, Optimized binary search and text retrieval, On the number of elements to reorder when updating a suffix array, 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, DSI: Distributed service integration for service grid, Unnamed Item, Towards a real time algorithm for parameterized longest common prefix computation, Full-Text Indexes for High-Throughput Sequencing, DNA-Seq Error Correction Based on Substring Indices, The Contig Assembly Problem and Its Algorithmic Solutions, On the string matching with \(k\) mismatches, Succincter Text Indexing with Wildcards, An elegant algorithm for the construction of suffix arrays, A randomized numerical aligner (rNA), Pattern matching in pseudo real-time, Computing regularities in strings: a survey, Efficient CRCW-PRAM algorithms for universal substring searching, Dynamic extended suffix arrays, Forty Years of Text Indexing, Data compression with long repeated strings, Unnamed Item, A four-stage algorithm for updating a Burrows-Wheeler transform, Unnamed Item, Indexing Structure for Graph-Structured Data, Random suffix search trees, An algorithm for string matching with a sequence of don't cares, Linear Time Suffix Array Construction Using D-Critical Substrings, Detecting Mutations by eBWT, Efficient computation of shortest absent words in a genomic sequence, What’s Behind Blast, Distributed suffix trees, On minimizing pattern splitting in multi-track string matching, Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
