scientific article; zbMATH DE number 5499319
From MaRDI portal
Publication:5506326
Recommendations
- An external-memory algorithm for string graph construction
- scientific article; zbMATH DE number 1559569
- scientific article; zbMATH DE number 3970104
- Algorithms and data structures for external memory
- scientific article; zbMATH DE number 1792107
- scientific article; zbMATH DE number 1424311
- Data structures and algorithms for the string statistics problem
- A data structure for a sequence of string accesses in external memory
Cited in
(12)- Constrained many-to-one string editing with memory
- Lyndon factorization algorithms for small alphabets and run-length encoded strings
- I/O-efficient data structures for non-overlapping indexing
- Time versus space trade-offs for rendezvous in trees
- An external-memory algorithm for string graph construction
- A data structure for a sequence of string accesses in external memory
- Suffix array and Lyndon factorization of a text
- scientific article; zbMATH DE number 1559569 (Why is no real title available?)
- An input/output efficient algorithm for Hessenberg reduction
- Obtaining Provably Good Performance from Suffix Trees in Secondary Storage
- External String Sorting: Faster and Cache-Oblivious
- scientific article; zbMATH DE number 7765406 (Why is no real title available?)
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 Q5506326)