A simple algorithm for computing the document array
From MaRDI portal
Publication:2011038
Abstract: We present a simple algorithm for computing the document array given a string collection and its suffix array as input. Our algorithm runs in linear time using constant additional space for strings from constant alphabets.
Recommendations
Cites work
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
- Algorithms to compute the Burrows-Wheeler similarity distribution
- An improved algorithm for the all-pairs suffix-prefix problem
- Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
- Cross-document pattern matching
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
- External memory BWT and LCP computation for sequence collections with applications
- Haplotype-aware graph indexes
- Improved compressed indexes for full-text document retrieval
- Inducing enhanced suffix arrays for string collections
- Lightweight metagenomic classification via eBWT
- Linear time algorithms for generalizations of the longest common substring problem
- Space-Efficient Algorithms for Document Retrieval
- Space-efficient construction of compressed indexes in deterministic linear time
- Succinct data structures for flexible text retrieval systems
- Suffix Arrays: A New Method for On-Line String Searches
This page was built for publication: A simple algorithm for computing the document array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011038)
